Sciweavers

158 search results - page 27 / 32
» Community Learning by Graph Approximation
Sort
View
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
15 years 4 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
ICML
2007
IEEE
16 years 10 days ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ALT
2010
Springer
15 years 1 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 3 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CSE
2009
IEEE
15 years 6 months ago
First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL
—Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often i...
Elizabeth M. Bonsignore, Cody Dunne, Dana Rotman, ...