27 search results - page 4 / 6 » Information Theoretic Angle-Based Spectral Clustering: A The... |
KDD
2003
ACM
14 years 6 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
KAIS
2011
13 years 29 days ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
SDM
2004
SIAM
13 years 7 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
DIS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We propose an association analysis-based strategy for exploration of multi-attribute spatial datasets possessing naturally arising classification. Proposed strategy, EST...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...