1662 search results - page 276 / 333 » Privately Finding Specifications |
KDD
2007
ACM
14 years 11 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...
KDD
2006
ACM
14 years 11 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
KDD
2006
ACM
14 years 11 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
KDD
2005
ACM
14 years 11 months ago
2005
ACM
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
KDD
2004
ACM
14 years 11 months ago
2004
ACM
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...