692 search results - page 79 / 139 » A new clustering algorithm for coordinate-free data |
WWW
2011
ACM
13 years 3 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
MICCAI
1999
Springer
14 years 12 days ago
1999
Springer
Abstract. A central problem in the analysis of functional magnetic resonance imaging (fMRI) data is the reliable detection and segmentation of activated areas. Often this goal is a...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
KAIS
2006
13 years 8 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...