8767 search results - page 1456 / 1754 » Enterprise Data Management |
197
click to vote
KDD
2007
ACM
16 years 7 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...
207
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
164
Voted
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
216
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
192
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Visitors enter a website through a variety of means, including web searches, links from other sites, and personal bookmarks. In some cases the first page loaded satisfies the visi...