Sciweavers

922 search results - page 3 / 185
» A data mining approach to database compression
Sort
View
KDD
1997
ACM
131views Data Mining» more  KDD 1997»
13 years 10 months ago
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
Gediminas Adomavicius, Alexander Tuzhilin
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 10 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 7 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 3 days ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
SSD
2007
Springer
133views Database» more  SSD 2007»
13 years 12 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...