Sciweavers

110 search results - page 12 / 22
» kdd 2005
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 10 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
KDD
2005
ACM
89views Data Mining» more  KDD 2005»
14 years 10 months ago
Mining risk patterns in medical data
In this paper, we discuss a problem of finding risk patterns in medical data. We define risk patterns by a statistical metric, relative risk, which has been widely used in epidemi...
Jiuyong Li, Ada Wai-Chee Fu, Hongxing He, Jie Chen...
KDD
2005
ACM
73views Data Mining» more  KDD 2005»
14 years 10 months ago
Using relational knowledge discovery to prevent securities fraud
We describe an application of relational knowledge discovery to a key regulatory mission of the National Association of Securities Dealers (NASD). NASD is the world's largest...
Özgür Simsek, David Jensen, Henry G. Gol...
KDD
2005
ACM
86views Data Mining» more  KDD 2005»
14 years 10 months ago
Probabilistic workflow mining
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
Ricardo Silva, Jiji Zhang, James G. Shanahan
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 10 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu