Sciweavers

5595 search results - page 396 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
16 years 3 days ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
ICAPR
2005
Springer
16 years 10 days ago
Hierarchical Clustering of Dynamical Systems Based on Eigenvalue Constraints
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
Hiroaki Kawashima, Takashi Matsuyama
MSWIM
2006
ACM
16 years 23 days ago
Analysis of soft handover measurements in 3G network
A neural network based clustering method for the analysis of soft handovers in 3G network is introduced. The method is highly visual and it could be utilized in explorative analys...
Kimmo Raivio
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...