Sciweavers

385 search results - page 23 / 77
» Probabilistic ranking over relations
Sort
View
PVLDB
2010
92views more  PVLDB 2010»
13 years 6 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi
JMLR
2002
138views more  JMLR 2002»
13 years 7 months ago
Learning Probabilistic Models of Link Structure
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Lise Getoor, Nir Friedman, Daphne Koller, Benjamin...
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 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
2005
ACM
73views Data Mining» more  KDD 2005»
14 years 8 months ago
Using relational knowledge discovery to prevent securities fraud
We describe an application of relational knowledge discovery to a key regulatory mission of the National Association of Securities Dealers (NASD). NASD is the world's largest...
Özgür Simsek, David Jensen, Henry G. Gol...
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 2 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...