Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasItem item-7.
- authorList hasItem item-8.
- authorList hasLastItem item-8.
- item-1 type ListItem.
- item-1 hasContent junfeng-wang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent xiaofei-he.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent can-wang.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent jian-pei.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent jiajun-bu.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent chun-chen.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent ziyu-guan.
- item-7 next item-8.
- item-7 previous item-6.
- item-8 type ListItem.
- item-8 hasContent lu-gang.
- item-8 previous item-7.
- 124 type InProceedings.
- 124 label "Graffiti: Node Labeling in Heterogeneous Networks".
- 124 sameAs 124.
- 124 abstract "".
- 124 hasAuthorList authorList.
- 124 isPartOf proceedings.
- 124 keyword "Poster Session".
- 124 title "Graffiti: Node Labeling in Heterogeneous Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent ralitsa-angelova.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent gjergji-kasneci.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent fabian-m-suchanek.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent gerhard-weikum.
- item-4 previous item-3.
- 125 type InProceedings.
- 125 label "Graph Based Crawler Seed Selection".
- 125 sameAs 125.
- 125 abstract "This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper seeds can increase the number of pages a crawler will discover, and can result in a collection with more "good" and less "bad" pages. Based on the analysis of the graph structure of the web, we propose several seed selection algorithms. Effectiveness of these algorithms is proved by our experimental results on real web data.".
- 125 hasAuthorList authorList.
- 125 isPartOf proceedings.
- 125 keyword "Poster Session".
- 125 title "Graph Based Crawler Seed Selection".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent shuyi-zheng.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent pavel-dmitriev.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent c-lee-giles.
- item-3 previous item-2.
- 126 type InProceedings.
- 126 label "Building Term Suggestion Relational Graphs from Collective Intelligence".
- 126 sameAs 126.
- 126 abstract "This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion' function has been included so that users can find the most appropriate query term to what they really need. Conventional approaches for term suggestion involve extracting frequently occurring key terms from retrieved documents. They must deal with term extraction difficulties and interference from irrelevant documents. In this paper, we propose a semantic term suggestion function called Collective Intelligence based Term Suggestion (CITS). CITS provides a novel social-network based framework for relevant terms suggestion with a semantic graph of the search term without limiting to the specific query term. A visualization of semantic graph is presented to the users to help browsing search results from related terms in the semantic graph. The search results are ranked each time according to their relevance to the related terms in the entire query session. Comparing to two popular commercial search engines, a user study of 18 users on 50 search terms showed better user satisfactions and indicated the potential usefulness of proposed method in real-world search applications.".
- 126 hasAuthorList authorList.
- 126 isPartOf proceedings.
- 126 keyword "Poster Session".
- 126 title "Building Term Suggestion Relational Graphs from Collective Intelligence".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.