Sciweavers

292 search results - page 54 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
ICDM
2008
IEEE
150views Data Mining» more  ICDM 2008»
14 years 1 months ago
Pseudolikelihood EM for Within-network Relational Learning
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
Rongjing Xiang, Jennifer Neville
BMCBI
2010
144views more  BMCBI 2010»
13 years 6 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
SIGIR
2011
ACM
12 years 9 months ago
Social context summarization
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
Zi Yang, Keke Cai, Jie Tang, Li Zhang, Zhong Su, J...
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
13 years 9 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 6 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec