Sciweavers

295 search results - page 29 / 59
» Frequent regular itemset mining
Sort
View
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
14 years 28 days ago
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
Marek Wojciechowski, Maciej Zakrzewicz
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
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
13 years 12 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
DAWAK
2009
Springer
13 years 11 months ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
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