Sciweavers

7758 search results - page 1398 / 1552
» On the Number of Distributive Lattices
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 6 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
231views Data Mining» more  KDD 2007»
16 years 6 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 6 months ago
A framework for classification and segmentation of massive audio data streams
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
Charu C. Aggarwal
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 6 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 6 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
« Prev « First page 1398 / 1552 Last » Next »