Sciweavers

245 search results - page 38 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
ICTAI
2003
IEEE
14 years 25 days ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
VLDB
1989
ACM
155views Database» more  VLDB 1989»
13 years 11 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
GIS
2006
ACM
14 years 8 months ago
Mining frequent geographic patterns with knowledge constraints
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
Luis Otávio Alvares, Paulo Martins Engel, S...
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
14 years 8 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...