Sciweavers

573 search results - page 44 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
IPL
2006
99views more  IPL 2006»
13 years 7 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
14 years 1 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
PVLDB
2010
135views more  PVLDB 2010»
13 years 6 months ago
Similarity Search and Mining in Uncertain Databases
Managing, searching and mining uncertain data has achieved much attention in the database community recently due to new sensor technologies and new ways of collecting data. There ...
Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, ...
FIMI
2004
123views Data Mining» more  FIMI 2004»
13 years 9 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon