Sciweavers

1887 search results - page 303 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 7 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 8 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
TMC
2012
11 years 10 months ago
Mobile Data Offloading through Opportunistic Communications and Social Participation
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marat...