4085 search results - page 197 / 817 » Benchmarking Data Mining Algorithms |
146
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
122
Voted
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
131
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
122
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
This paper considers the use of computational stylistics for performing authorship attribution of electronic messages, addressing categorization problems with as many as 20 differ...
112
Voted
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...