Sciweavers

159 search results - page 2 / 32
» Consistent Minimization of Clustering Objective Functions
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ICPR
2008
IEEE
13 years 11 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
TKDE
2008
197views more  TKDE 2008»
13 years 5 months ago
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
In this paper, we present an agglomerative fuzzy K-Means clustering algorithm for numerical data, an extension to the standard fuzzy K-Means algorithm by introducing a penalty term...
Mark Junjie Li, Michael K. Ng, Yiu-ming Cheung, Jo...
KDD
1995
ACM
98views Data Mining» more  KDD 1995»
13 years 8 months ago
Optimization and Simplification of Hierarchical Clusterings
Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to se...
Douglas Fisher
ASUNAM
2011
IEEE
12 years 5 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...