Sciweavers

728 search results - page 111 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
14 years 8 months ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 4 months ago
Measuring Discrimination in Socially-Sensitive Decision Records.
Discrimination in social sense (e.g., against minorities and disadvantaged groups) is the subject of many laws worldwide, and it has been extensively studied in the social and eco...
Dino Pedreschi, Franco Turini, Salvatore Ruggieri
WSDM
2009
ACM
163views Data Mining» more  WSDM 2009»
14 years 2 months ago
Tagging with Queries: How and Why?
Web search queries capture the information need of search engine users. Search engines store these queries in their logs and analyze them to guide their search results. In this wo...
Ioannis Antonellis, Hector Garcia-Molina, Jawed Ka...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer