1813 search results - page 50 / 363 » Instance Pruning Techniques |
157
click to vote
PATAT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
133
click to vote
TKDE
2010
15 years 2 months ago
2010
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
128
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
129
click to vote
CONEXT
2009
ACM
15 years 5 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
111
click to vote
FIMI
2003
15 years 5 months ago
2003
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...