Sciweavers

136 search results - page 1 / 28
» Finding Alternative Clusterings Using Constraints
Sort
View
ICDM
2008
IEEE
90views Data Mining» more  ICDM 2008»
13 years 11 months ago
Finding Alternative Clusterings Using Constraints
1 The aim of data mining is to find novel and actionable insights. However, most algorithms typically just find a single explanation of the data even though alternatives could e...
Ian Davidson, Zijie Qi
DEXA
2010
Springer
156views Database» more  DEXA 2010»
13 years 6 months ago
Improving Alternative Text Clustering Quality in the Avoiding Bias Task with Spectral and Flat Partition Algorithms
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
M. Eduardo Ares, Javier Parapar, Alvaro Barreiro
ICML
2010
IEEE
13 years 5 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
PAMI
2008
152views more  PAMI 2008»
13 years 4 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
ICDE
2010
IEEE
195views Database» more  ICDE 2010»
13 years 5 months ago
Advances in constrained clustering
— Constrained clustering (semi-supervised learning) techniques have attracted more attention in recent years. However, the commonly used constraints are restricted to the instanc...
ZiJie Qi, Yinghui Yang