418 search results - page 74 / 84 » A New Pattern Representation Scheme Using Data Compression |
109
click to vote
DMKD
1997
ACM
15 years 5 months ago
1997
ACM
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...
209
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
93
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
121
click to vote
APPT
2007
Springer
15 years 2 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...