Sciweavers

KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 5 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
KDD
2007
ACM
237views Data Mining» more  KDD 2007»
14 years 5 months ago
Knowledge discovery of multiple-topic document using parametric mixture model with dirichlet prior
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
Issei Sato, Hiroshi Nakagawa
KDD
2007
ACM
211views Data Mining» more  KDD 2007»
14 years 5 months ago
Enhanced max margin learning on multimodal data mining in a multimedia database
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos F...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 5 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen
KDD
2007
ACM
145views Data Mining» more  KDD 2007»
14 years 5 months ago
Webpage understanding: an integrated approach
Jun Zhu, Bo Zhang, Zaiqing Nie, Ji-Rong Wen, Hsiao...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 5 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 5 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 5 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 5 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...