17366 search results - page 371 / 3474 » New Revision Algorithms |
170
click to vote
KDD
1997
ACM
15 years 11 months ago
1997
ACM
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
171
click to vote
PRICAI
2000
Springer
15 years 10 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
161
click to vote
DATESO
2007
15 years 8 months ago
2007
Abstract. Syllable based text compression is a new approach to compression by symbols. In this concept syllables are used as the compression symbols instead of the more common char...
179
click to vote
IJIT
2004
15 years 8 months ago
2004
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...
178
click to vote
COLING
1994
15 years 8 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...