Sciweavers

1357 search results - page 1 / 272
» Clustering Orders
Sort
View
ICPR
2008
IEEE
13 years 11 months ago
Partial closure-based constrained clustering with order ranking
In this paper we propose a new partial closure-based constrained clustering algorithm. We introduce closures into the partial constrained clustering and we propose a new measureme...
Shaohong Zhang, Hau-San Wong
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
13 years 8 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
13 years 9 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
13 years 11 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 6 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu