Sciweavers

1531 search results - page 195 / 307
» Learning probabilistic models of the Web
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Matching directories and OWL ontologies with AROMA
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
Jérôme David, Fabrice Guillet, Henri ...
CIA
2007
Springer
16 years 18 days ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp
ICPR
2008
IEEE
16 years 7 months ago
Weakly supervised learning using proportion-based information: An application to fisheries acoustics
This paper addresses the inference of probabilistic classification models using weakly supervised learning. In contrast to previous work, the use of proportion-based training data...
Carla Scalarin, Jacques Masse, Jean-Marc Boucher, ...
SIGIR
2011
ACM
14 years 9 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...
WWW
2005
ACM
16 years 7 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham