Sciweavers

388 search results - page 11 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
ISCIS
2004
Springer
14 years 26 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...
ICTAI
2007
IEEE
14 years 1 months ago
Towards Rare Itemset Mining
We describe here a general approach for rare itemset mining. While mining literature has been almost exclusively focused on frequent itemsets, in many practical situations rare on...
Laszlo Szathmary, Amedeo Napoli, Petko Valtchev
PODS
2003
ACM
151views Database» more  PODS 2003»
14 years 7 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
SIGKDD
2000
70views more  SIGKDD 2000»
13 years 7 months ago
The Segment Support Map: Scalable Mining of Frequent Itemsets
Laks V. S. Lakshmanan, Carson Kai-Sang Leung, Raym...
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 1 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan