Sciweavers

69 search results - page 12 / 14
» An Efficient Algorithm for Enumerating Closed Patterns in Tr...
Sort
View
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
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
VLDB
1991
ACM
81views Database» more  VLDB 1991»
13 years 11 months ago
On Maintaining Priorities in a Production Rule System
We present a priority system which is particularly suited for production rules coupled to databases. In this system, there are default priorities between all rules and overriding ...
Rakesh Agrawal, Roberta Cochrane, Bruce G. Lindsay
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 8 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 8 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...