Sciweavers

16257 search results - page 3067 / 3252
» D-finiteness: algorithms and applications
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 7 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
16 years 7 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada
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
381views Data Mining» more  KDD 2006»
16 years 7 months ago
GPLAG: detection of software plagiarism by program dependence graph analysis
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
Chao Liu 0001, Chen Chen, Jiawei Han, Philip S. Yu
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
16 years 7 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
« Prev « First page 3067 / 3252 Last » Next »