Sciweavers

2065 search results - page 156 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 7 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
AISADM
2007
Springer
16 years 19 days ago
Peer-to-Peer Data Mining, Privacy Issues, and Games
Peer-to-Peer (P2P) networks are gaining increasing popularity in many distributed applications such as file-sharing, network storage, web caching, searching and indexing of releva...
Kanishka Bhaduri, Kamalika Das, Hillol Kargupta
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 10 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
15 years 12 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
ICPR
2002
IEEE
16 years 7 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela