poster

Generating hypotheses from the web

Authors:

Wei Jin,

Rohini Srihari,

Abhishek SinghAuthors Info & Claims

WWW '08: Proceedings of the 17th international conference on World Wide Web

Pages 1211 - 1212

https://doi.org/10.1145/1367497.1367731

Published: 21 April 2008 Publication History

Get Access

Abstract

Hypothesis generation is a crucial initial step for making scientific discoveries. This paper addresses the problem of automatically discovering interesting hypotheses from the web. Given a query containing one or two entities of interest, our algorithm automatically generates a semantic profile describing the specified entity or provides the potential connections between two entities of interest. We implemented a prototype on top of the Google search engine and the experimental results demonstrate the effectiveness of our algorithms.

References

[1]

Swason, D. R. Complementary Structures in Disjoint Science Literatures. ACM SIGIR (1991), 280--289.

Digital Library

Google Scholar

[2]

Smalheiser, N. R. The Arrowsmith Project: 2005 Status Report. Discovery Science 2005: 26--43.

Digital Library

Google Scholar

[3]

Srinivasan, P. Text Mining: Generating Hypotheses from MEDLINE. JASIST 55(5): 396--413, 2004.

Digital Library

Google Scholar

[4]

Das-Neves, F., Fox, E. A. and Yu, X. Connecting Topics in Document Collections with Stepping Stones and Pathways. CIKM '05, ACM Press, Bremen, Ger., Nov. 2005, pp. 91--98.

Digital Library

Google Scholar

[5]

Luo, G., Tang, C. and Tian, Y. Answering Relationship Queries on the Web. WWW2007, pp. 561-5-5-570.

Digital Library

Google Scholar

[6]

Jin, W., Srihari, R. K., Ho, H. and Wu, X. Improving Knowledge Discovery in Document Collections through Combining Text Retrieval and Link Analysis Techniques. (ICDM'07), pp.193--202.

Google Scholar

Cited By

View all

Nugent TLeidner J(2016)Risk Mining: Company-Risk Identification from Unstructured Sources2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW.2016.0191(1308-1311)Online publication date: Dec-2016
https://doi.org/10.1109/ICDMW.2016.0191
Yan PJin W(2015)Improving Cross-Document Knowledge Discovery Through Content and Link Analysis of Wikipedia KnowledgeTransactions on Large-Scale Data- and Knowledge-Centered Systems XXI10.1007/978-3-662-47804-2_8(161-184)Online publication date: 17-Jul-2015
https://doi.org/10.1007/978-3-662-47804-2_8
Jin WWu XHuang JKoudas NJones GWu XCollins-Thompson KAn A(2010)Discovering, ranking and annotating cross-document relationships between conceptsProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871768(1929-1930)Online publication date: 26-Oct-2010
https://dl.acm.org/doi/10.1145/1871437.1871768

Index Terms

Generating hypotheses from the web
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing

Recommendations

Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization

Algorithms such as Kleinberg's HITS algorithm, the PageRank algorithm of Brin and Page, and the SALSA algorithm of Lempel and Moran use the link structure of a network of web pages to assign weights to each page in the network. The weights can then be ...
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search

The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative “importance” of Web pages, independent of any particular search query. To yield more ...
Using web-graph distance for relevance feedback in web search
SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval

We study the effect of user supplied relevance feedback in improving web search results. Rather than using query refinement or document similarity measures to rerank results, we show that the web-graph distance between two documents is a robust measure ...

Comments

Information & Contributors

Information

Published In

WWW '08: Proceedings of the 17th international conference on World Wide Web

April 2008

1326 pages

ISBN:9781605580852

DOI:10.1145/1367497

General Chairs:
Jinpeng Huai
Beihang University, China
,
Robin Chen
AT&T Labs, USA
,
Hsiao-Wuen Hon
Microsoft Research Asia, China
,
Yunhao Liu
HK University of Science and Technology, Hong Kong
,
Program Chairs:
Wei-Ying Ma
Microsoft Research Asia, China
,
Andrew Tomkins
Yahoo! Research, USA
,
Xiaodong Zhang
The Ohio State University, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 April 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

WWW '08

Sponsor:

WWW '08: The 17th International World Wide Web Conference

April 21 - 25, 2008

Beijing, China

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
210
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nugent TLeidner J(2016)Risk Mining: Company-Risk Identification from Unstructured Sources2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW.2016.0191(1308-1311)Online publication date: Dec-2016
https://doi.org/10.1109/ICDMW.2016.0191
Yan PJin W(2015)Improving Cross-Document Knowledge Discovery Through Content and Link Analysis of Wikipedia KnowledgeTransactions on Large-Scale Data- and Knowledge-Centered Systems XXI10.1007/978-3-662-47804-2_8(161-184)Online publication date: 17-Jul-2015
https://doi.org/10.1007/978-3-662-47804-2_8
Jin WWu XHuang JKoudas NJones GWu XCollins-Thompson KAn A(2010)Discovering, ranking and annotating cross-document relationships between conceptsProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871768(1929-1930)Online publication date: 26-Oct-2010
https://dl.acm.org/doi/10.1145/1871437.1871768

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization

Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search

Using web-graph distance for relevance feedback in web search