Sciweavers

2048 search results - page 358 / 410
» The Tale of Two Projects - Abstract
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 3 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
142
Voted
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 3 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 3 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
112
Voted
KDD
2005
ACM
130views Data Mining» more  KDD 2005»
16 years 3 months ago
Simple and effective visual models for gene expression cancer diagnostics
In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple ...
Gregor Leban, Minca Mramor, Ivan Bratko, Blaz Zupa...
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 3 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker