279 search results - page 55 / 56 » Methods for finding frequent items in data streams |
KDD
2007
ACM
14 years 6 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
BMCBI
2010
13 years 5 months ago
2010
Background: The Medium-chain Dehydrogenases/Reductases (MDR) form a protein superfamily whose size and complexity defeats traditional means of subclassification; it currently has ...
BMCBI
2007
13 years 5 months ago
2007
Background: Homology is a key concept in both evolutionary biology and genomics. Detection of homology is crucial in fields like the functional annotation of protein sequences and...
KDD
2010
ACM
13 years 3 months ago
2010
ACM
The dynamic marketplace in online advertising calls for ranking systems that are optimized to consistently promote and capitalize better performing ads. The streaming nature of on...
SSD
2007
Springer
13 years 12 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...