Sciweavers

2227 search results - page 68 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 29 days ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
103
Voted
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
15 years 9 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
100
Voted
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 6 months ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik
96
Voted
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
15 years 6 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao
PAMI
2007
202views more  PAMI 2007»
15 years 2 days ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis