199 search results - page 10 / 40 » Fast Algorithms for Computing Tree LCS |
APPINF
2003
13 years 10 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
ICDE
2000
IEEE
14 years 10 months ago
2000
IEEE
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
TCSV
2008
13 years 8 months ago
2008
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
TKDE
2008
13 years 8 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
JMIV
2002
13 years 8 months ago
2002
In our recent work, a class of parametric transforms, including family of Haar-like transforms, was introduced and studied in application to image compression. Parametric Haar-lik...