Sciweavers

1937 search results - page 95 / 388
» Conditioning Probabilistic Databases
Sort
View
EDBT
2008
ACM
99views Database» more  EDBT 2008»
15 years 10 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
SDM
2010
SIAM
166views Data Mining» more  SDM 2010»
14 years 8 months ago
Directed Network Community Detection: A Popularity and Productivity Link Model
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
Tianbao Yang, Yun Chi, Shenghuo Zhu, Yihong Gong, ...
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
15 years 10 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
ICML
2001
IEEE
15 years 11 months ago
Learning Probabilistic Models of Relational Structure
Most real-world data is stored in relational form. In contrast, most statistical learning methods work with "flat" data representations, forcing us to convert our data i...
Lise Getoor, Nir Friedman, Daphne Koller, Benjamin...
ILP
1999
Springer
15 years 2 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller