Sciweavers

42230 search results - page 8042 / 8446
» Algorithms and Complexity Results for
Sort
View
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
2004
ACM
179views Data Mining» more  KDD 2004»
16 years 7 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang
KDD
2003
ACM
161views Data Mining» more  KDD 2003»
16 years 7 months ago
Eliminating noisy information in Web pages for data mining
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...
Lan Yi, Bing Liu, Xiaoli Li
POPL
2008
ACM
16 years 7 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
POPL
2007
ACM
16 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
« Prev « First page 8042 / 8446 Last » Next »