Sciweavers

291 search results - page 18 / 59
» Clustering and the Biclique Partition Problem
Sort
View
ICA
2007
Springer
14 years 26 days ago
Text Clustering on Latent Thematic Spaces: Variants, Strengths and Weaknesses
Deriving a thematically meaningful partition of an unlabeled document corpus is a challenging task. In this context, the use of document representations based on latent thematic ge...
Xavier Sevillano, Germán Cobo, Francesc Al&...
NIPS
2007
13 years 10 months ago
DIFFRAC: a discriminative and flexible framework for clustering
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
Francis Bach, Zaïd Harchaoui
JCSS
2002
199views more  JCSS 2002»
13 years 8 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
IJCNN
2000
IEEE
14 years 1 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
INFORMATICALT
2008
124views more  INFORMATICALT 2008»
13 years 9 months ago
Hierarchical Adaptive Clustering
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...
Gabriela Serban, Alina Campan