4085 search results - page 300 / 817 » Benchmarking Data Mining Algorithms |
137
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
153
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
147
Voted
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
130
click to vote
FIMI
2003
15 years 5 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
119
click to vote
ACSAC
2001
IEEE
15 years 7 months ago
2001
IEEE
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...