Sciweavers

1215 search results - page 41 / 243
» Numbers in Multi-relational Data Mining
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 6 days ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
16 years 6 days ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 1 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
16 years 6 days ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
LSSC
2001
Springer
15 years 4 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel