Sciweavers

5595 search results - page 75 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IJCNN
2006
IEEE
15 years 10 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
ICSM
2005
IEEE
15 years 10 months ago
Comparison of Clustering Algorithms in the Context of Software Evolution
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
Jingwei Wu, Ahmed E. Hassan, Richard C. Holt
ALGORITHMICA
2004
153views more  ALGORITHMICA 2004»
15 years 4 months ago
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
Jochen Könemann, Asaf Levin, Amitabh Sinha
KES
2008
Springer
15 years 4 months ago
An Algorithm to Assess the Reliability of Hierarchical Clusters in Gene Expression Data
The validation of clusters discovered in bio-molecular data is a central issue in bioinformatics. Recently, stability-based methods have been successfully applied to the analysis o...
Roberto Avogadri, Matteo Brioschi, Francesca Ruffi...
DEXA
2010
Springer
156views Database» more  DEXA 2010»
15 years 5 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