Sciweavers

291 search results - page 3 / 59
» Clustering and the Biclique Partition Problem
Sort
View
JUCS
2002
131views more  JUCS 2002»
13 years 5 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
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
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 5 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
13 years 9 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
MCS
2001
Springer
13 years 10 months ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred