Sciweavers

SEBD
2008
159views Database» more  SEBD 2008»
13 years 11 months ago
Profiling Sets for Preference Querying
We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences o...
Xi Zhang, Jan Chomicki
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 2 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