Sciweavers

4009 search results - page 34 / 802
» Clustering on Complex Graphs
Sort
View
ICTAI
2009
IEEE
14 years 9 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
ENDM
2010
122views more  ENDM 2010»
14 years 12 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...
BMCBI
2006
150views more  BMCBI 2006»
14 years 12 months ago
Cluster analysis of protein array results via similarity of Gene Ontology annotation
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
Cheryl Wolting, C. Jane McGlade, David Tritchler
FLAIRS
2000
15 years 1 months ago
Graph-Based Hierarchical Conceptual Clustering
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 6 days ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis