Sciweavers

573 search results - page 31 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
IJFCS
2008
102views more  IJFCS 2008»
13 years 7 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
ICDM
2002
IEEE
131views Data Mining» more  ICDM 2002»
14 years 19 days ago
Using Sequential and Non-Sequential Patterns in Predictive Web Usage Mining Tasks
We describe an efficient framework for Web personalization based on sequential and non-sequential pattern discovery from usage data. Our experimental results performed on real us...
Bamshad Mobasher, Honghua Dai, Tao Luo, Miki Nakag...
CIKM
2009
Springer
14 years 10 days ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
HAIS
2011
Springer
12 years 11 months ago
Evolving Temporal Fuzzy Association Rules from Quantitative Data with a Multi-Objective Evolutionary Algorithm
A novel method for mining association rules that are both quantitative and temporal using a multi-objective evolutionary algorithm is presented. This method successfully identifie...
Stephen G. Matthews, Mario A. Góngora, Adri...
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
14 years 1 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz