Sciweavers

169 search results - page 14 / 34
» Mining Frequent Itemsets using Patricia Tries
Sort
View
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 1 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
IDA
2008
Springer
13 years 7 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals
ISCIS
2004
Springer
14 years 23 days ago
A Study on Answering a Data Mining Query Using a Materialized View
One of the classic data mining problems is discovery of frequent itemsets. This problem particularly attracts database community as it resembles traditional database querying. In t...
Maciej Zakrzewicz, Mikolaj Morzy, Marek Wojciechow...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 24 days ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 7 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig