Sciweavers

4972 search results - page 771 / 995
» Ranking on graph data
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining optimal decision trees from itemset lattices
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...
Élisa Fromont, Siegfried Nijssen
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 7 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
16 years 7 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
WSDM
2010
ACM
251views Data Mining» more  WSDM 2010»
16 years 3 months ago
Large Scale Query Log Analysis of Re-Finding
Although Web search engines are targeted towards helping people find new information, people regularly use them to re-find Web pages they have seen before. Researchers have noted ...
Jaime Teevan, Sarah K. Tyler
CVPR
2010
IEEE
16 years 2 months ago
Pareto Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
Karim Abou-Moustafa, Fernando De la Torre, Frank F...