Sciweavers

961 search results - page 25 / 193
» Significance-Driven Graph Clustering
Sort
View
FLAIRS
2000
13 years 11 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»
14 years 10 months 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
BMCBI
2011
13 years 4 months ago
Properties of Metabolic Graphs: Biological Organization or Representation Artifacts?
Background: Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation th...
Wanding Zhou, Luay Nakhleh
IM
2008
13 years 9 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 3 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...