Sciweavers

1314 search results - page 59 / 263
» Approximate data mining in very large relational data
Sort
View
SIGSOFT
2007
ACM
16 years 2 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 3 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
CIKM
2009
Springer
14 years 11 months ago
Diverging patterns: discovering significant frequency change dissimilarities in large databases
In this paper, we present a framework for mining diverging patterns, a new type of contrast patterns whose frequency changes significantly differently in two data sets, e.g., it c...
Aijun An, Qian Wan, Jiashu Zhao, Xiangji Huang
120
Voted
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
16 years 1 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 2 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth