Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.
© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 04. Juni 2021)
1Luo, Z. ; Yu, Y. ; Osborne, M. ; Wang, T.: Structuring tweets for improving Twitter search.
In: Journal of the Association for Information Science and Technology. 66(2015) no.12, S.2522-2539.
Abstract: Spam and wildly varying documents make searching in Twitter challenging. Most Twitter search systems generally treat a Tweet as a plain text when modeling relevance. However, a series of conventions allows users to Tweet in structural ways using a combination of different blocks of texts. These blocks include plain texts, hashtags, links, mentions, etc. Each block encodes a variety of communicative intent and the sequence of these blocks captures changing discourse. Previous work shows that exploiting the structural information can improve the structured documents (e.g., web pages) retrieval. In this study we utilize the structure of Tweets, induced by these blocks, for Twitter retrieval and Twitter opinion retrieval. For Twitter retrieval, a set of features, derived from the blocks of text and their combinations, is used into a learning-to-rank scenario. We show that structuring Tweets can achieve state-of-the-art performance. Our approach does not rely on social media features, but when we do add this additional information, performance improves significantly. For Twitter opinion retrieval, we explore the question of whether structural information derived from the body of Tweets and opinionatedness ratings of Tweets can improve performance. Experimental results show that retrieval using a novel unsupervised opinionatedness feature based on structuring Tweets achieves comparable performance with a supervised method using manually tagged Tweets. Topic-related specific structured Tweet sets are shown to help with query-dependent opinion retrieval.
Inhalt: Vgl.: http://onlinelibrary.wiley.com/doi/10.1002/asi.23332/abstract.
Themenfeld: Internet ; Computerlinguistik
2Cao, Y. ; Duan, H. ; Lin, C.-L. ; Yu, Y.: Re-ranking question search results by clustering questions.
In: Journal of the American Society for Information Science and Technology. 62(2011) no.6, S.1177-1187.
Abstract: In this article, we address the problem of question clustering and study its use for re-ranking question search results. In question clustering we have to organize question search results into certain meaningful and condensed groups. Specifically, we propose to use a data structure consisting of question topic and question focus for modeling questions, and then cluster questions on the basis of the data structure. Experimental results show that our approach to question clustering improves the performance of question search significantly better than the approach not utilizing the topic-focus structure.
3Wang, H. ; Liu, Q. ; Penin, T. ; Fu, L. ; Zhang, L. ; Tran, T. ; Yu, Y. ; Pan, Y.: Semplore: a scalable IR approach to search the Web of Data.
In: Web semantics: science, services and agents on the World Wide Web. 7(2009) no.3, S.177-188.
Abstract: The Web of Data keeps growing rapidly. However, the full exploitation of this large amount of structured data faces numerous challenges like usability, scalability, imprecise information needs and data change. We present Semplore, an IR-based system that aims at addressing these issues. Semplore supports intuitive faceted search and complex queries both on text and structured data. It combines imprecise keyword search and precise structured query in a unified ranking scheme. Scalable query processing is supported by leveraging inverted indexes traditionally used in IR systems. This is combined with a novel block-based index structure to support efficient index update when data changes. The experimental results show that Semplore is an efficient and effective system for searching the Web of Data and can be used as a basic infrastructure for Web-scale Semantic Web search engines.
Inhalt: Vgl.: http://www.sciencedirect.com/science/article/pii/S1570826809000262.
Themenfeld: Semantic Web ; Wissensrepräsentation
4Song, R. ; Luo, Z. ; Nie, J.-Y. ; Yu, Y. ; Hon, H.-W.: Identification of ambiguous queries in web search.
In: Information processing and management. 45(2009) no.2, S.216-229.
Abstract: It is widely believed that many queries submitted to search engines are inherently ambiguous (e.g., java and apple). However, few studies have tried to classify queries based on ambiguity and to answer "what the proportion of ambiguous queries is". This paper deals with these issues. First, we clarify the definition of ambiguous queries by constructing the taxonomy of queries from being ambiguous to specific. Second, we ask human annotators to manually classify queries. From manually labeled results, we observe that query ambiguity is to some extent predictable. Third, we propose a supervised learning approach to automatically identify ambiguous queries. Experimental results show that we can correctly identify 87% of labeled queries with the approach. Finally, by using our approach, we estimate that about 16% of queries in a real search log are ambiguous.
Themenfeld: Suchmaschinen ; Suchtaktik
5Zhang, L. ; Liu, Q.L. ; Zhang, J. ; Wang, H.F. ; Pan, Y. ; Yu, Y.: Semplore: an IR approach to scalable hybrid query of Semantic Web data.
In: Proceeding ISWC'07/ASWC'07 : Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference. Ed.: K. Aberer et al. Berlin : Springer, 2007. S.652-665.
(Lecture notes in computer science; 4825)
Abstract: As an extension to the current Web, Semantic Web will not only contain structured data with machine understandable semantics but also textual information. While structured queries can be used to find information more precisely on the Semantic Web, keyword searches are still needed to help exploit textual information. It thus becomes very important that we can combine precise structured queries with imprecise keyword searches to have a hybrid query capability. In addition, due to the huge volume of information on the Semantic Web, the hybrid query must be processed in a very scalable way. In this paper, we define such a hybrid query capability that combines unary tree-shaped structured queries with keyword searches. We show how existing information retrieval (IR) index structures and functions can be reused to index semantic web data and its textual information, and how the hybrid query is evaluated on the index structure using IR engines in an efficient and scalable manner. We implemented this IR approach in an engine called Semplore. Comprehensive experiments on its performance show that it is a promising approach. It leads us to believe that it may be possible to evolve current web search engines to query and search the Semantic Web. Finally, we briefy describe how Semplore is used for searching Wikipedia and an IBM customer's product information.
Inhalt: Vgl.: http://mathcs.emory.edu/~qliu26/docs/iswc07.pdf.
Themenfeld: Semantic Web ; Wissensrepräsentation