Sciweavers

10 search results - page 2 / 2
» Graph based crawler seed selection
Sort
View
APWEB
2010
Springer
13 years 10 months ago
Crawling Online Social Graphs
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
Shaozhi Ye, Juan Lang, Shyhtsun Felix Wu
WEBI
2010
Springer
13 years 3 months ago
Relations Expansion: Extracting Relationship Instances from the Web
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
Haibo Li, Yutaka Matsuo, Mitsuru Ishizuka
JCB
2002
160views more  JCB 2002»
13 years 5 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
CVPR
2009
IEEE
14 years 3 days ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan
BMCBI
2008
160views more  BMCBI 2008»
13 years 5 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...