Sciweavers

670 search results - page 17 / 134
» Intractability and clustering with constraints
Sort
View
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
15 years 10 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
15 years 3 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
15 years 1 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
NIPS
2008
14 years 11 months ago
Implicit Mixtures of Restricted Boltzmann Machines
We present a mixture model whose components are Restricted Boltzmann Machines (RBMs). This possibility has not been considered before because computing the partition function of a...
Vinod Nair, Geoffrey E. Hinton
75
Voted
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 1 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