Sciweavers

7053 search results - page 1096 / 1411
» Data Mining
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 7 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
164
Voted
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 7 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
« Prev « First page 1096 / 1411 Last » Next »