Sciweavers

616 search results - page 78 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
JCDL
2006
ACM
172views Education» more  JCDL 2006»
14 years 1 months ago
A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
Illhoi Yoo, Xiaohua Hu
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
TRECVID
2007
13 years 8 months ago
Eurecom at TRECVid 2007: Extraction of High-level Features
In this paper we describe our experiments for the high level features extraction task of TRECVid 2007. Our approach is different than previous submissions in that we have impleme...
Rachid Benmokhtar, Eric Galmar, Benoit Huet
ISBRA
2007
Springer
14 years 1 months ago
GFBA: A Biclustering Algorithm for Discovering Value-Coherent Biclusters
Clustering has been one of the most popular approaches used in gene expression data analysis. A clustering method is typically used to partition genes according to their similarity...
Xubo Fei, Shiyong Lu, Horia F. Pop, Lily R. Liang