Sciweavers

2070 search results - page 124 / 414
» Regret-Minimizing Representative Databases
Sort
View
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 7 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
228
Voted
ICDE
2000
IEEE
174views Database» more  ICDE 2000»
16 years 4 months ago
Self-Adaptive User Profiles for Large-Scale Data Delivery
Push-based data delivery requires knowledge of user interests for making scheduling, bandwidthallocation, and routing decisions. Such information is maintained as user profiles. W...
C. Lee Giles, Michael J. Franklin, Ugur Çet...
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 3 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 8 months ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
15 years 4 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...