Sciweavers

538 search results - page 38 / 108
» Dimension induced clustering
Sort
View
SSPR
2004
Springer
14 years 1 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 1 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
14 years 3 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 10 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
BIRTHDAY
2009
Springer
13 years 6 months ago
Management of UML Clusters
Abstract. Software engineering uses UML diagrams as a standard technique for specification and development of software. Various UML diagrams are used for specification of different...
Peggy Schmidt, Bernhard Thalheim