Sciweavers

2326 search results - page 428 / 466
» Discovering significant patterns
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 days ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
16 years 6 days ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 6 days ago
On-board analysis of uncalibrated data for a spacecraft at mars
Analyzing data on-board a spacecraft as it is collected enables several advanced spacecraft capabilities, such as prioritizing observations to make the best use of limited bandwid...
Benyang Tang, Kiri Wagstaff, Rebecca Castañ...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 days 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
178views Data Mining» more  KDD 2007»
16 years 6 days 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