Sciweavers

1217 search results - page 237 / 244
» On compressing frequent patterns
Sort
View
99
Voted
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 3 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 3 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
CIKM
2009
Springer
15 years 3 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
CCGRID
2004
IEEE
15 years 3 months ago
Supporting quality of service in a non-dedicated opportunistic environment
In this paper we investigate the utilization of nondedicated, opportunistic resources in a desktop environment to provide statistical assurances to a class of QoS sensitive, soft ...
Jin Liang, Klara Nahrstedt
ECTEL
2006
Springer
15 years 3 months ago
Getting to Know Your Student in Distance Learning Contexts
Abstract. Good teachers know their students, and exploit this knowledge to adapt or optimise their instruction. Teachers know their students because they interact with them face-to...
Claus Zinn, Oliver Scheuer