Sciweavers

447 search results - page 24 / 90
» Data Mining Architectures - A Comparative Study
Sort
View
SAC
2006
ACM
15 years 5 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 1 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ICCS
2003
Springer
15 years 5 months ago
Design and Evaluation of Distributed Smart Disk Architecture for I/O-Intensive Workloads
Smart disks, a type of processor-embedded active I/O devices, with their on-disk memory and network interface controller, can be viewed as processing elements with attached storage...
Steve C. Chiu, Wei-keng Liao, Alok N. Choudhary
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 6 days ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
WWW
2011
ACM
14 years 6 months ago
Domain-independent entity extraction from web search query logs
Query logs of a Web search engine have been increasingly used as a vital source for data mining. This paper presents a study on largescale domain-independent entity extraction fro...
Alpa Jain, Marco Pennacchiotti