Sciweavers

377 search results - page 14 / 76
» Assessing Data Mining Results on Matrices with Randomization
Sort
View
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
KDD
2002
ACM
128views Data Mining» more  KDD 2002»
14 years 9 months ago
Privacy preserving mining of association rules
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
Alexandre V. Evfimievski, Ramakrishnan Srikant, Ra...
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Mining Protein Sequence Motifs Representing Common 3D Structures
Understanding the relationship between protein structure and its sequence is one of the most important tasks of current bioinformatics research. In this work, recurring protein se...
Wei Zhong, Gulsah Altun, Robert W. Harrison, Phang...
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 11 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra