16404 search results - page 706 / 3281 » A set coverage problem |
207
Voted
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
188
click to vote
GRC
2007
IEEE
16 years 1 months ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
221
click to vote
ANNPR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
200
Voted
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
216
Voted
ECML
2007
Springer
15 years 11 months ago
2007
Springer
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...