Sciweavers

4085 search results - page 590 / 817
» Benchmarking Data Mining Algorithms
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
16 years 4 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
CIKM
2011
Springer
14 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 8 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
SIGKDD
2010
126views more  SIGKDD 2010»
15 years 1 months ago
MultiClust 2010: discovering, summarizing and using multiple clusterings
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
Xiaoli Z. Fern, Ian Davidson, Jennifer G. Dy
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning from multi-topic web documents for contextual advertisement
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) ...
Yi Zhang, Arun C. Surendran, John C. Platt, Mukund...