Sciweavers

204 search results - page 37 / 41
» Hiding Sensitive Patterns in Association Rules Mining
Sort
View
FQAS
2004
Springer
146views Database» more  FQAS 2004»
13 years 11 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
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
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
SEDE
2007
13 years 9 months ago
Self-organizing map based web pages clustering using web logs
A Web-based business always wants to have the ability to track users’ browsing behavior history. This ability can be achieved by using Web log mining technologies. In this paper...
Dehu Qi, Chung-Chih Li
SEMCO
2008
IEEE
14 years 1 months ago
A Comparative Study of Feature Extraction Algorithms in Customer Reviews
The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach [17] identifies candidate featu...
Liliana Ferreira, Niklas Jakob, Iryna Gurevych