126 search results - page 1 / 26» Finding low-entropy sets and trees from binary data |

KDD

2007

ACM

14 years 8 months ago
2007

ACM

The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...

CANDC

2005

ACM

13 years 7 months ago
2005

ACM

The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...

ALGORITHMICA

2010

13 years 8 months ago
2010

We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...

RSCTC

2000

Springer

13 years 11 months ago
2000

Springer

The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...

SODA

2008

ACM

13 years 9 months ago
2008

ACM

We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...