-
Poynder, R.: Web research engines? (1996)
0.12
0.12309804 = product of:
0.18464705 = sum of:
0.0986154 = weight(_text_:search in 5698) [ClassicSimilarity], result of:
0.0986154 = score(doc=5698,freq=12.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.5643796 = fieldWeight in 5698, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=5698)
0.08603165 = product of:
0.1720633 = sum of:
0.1720633 = weight(_text_:engines in 5698) [ClassicSimilarity], result of:
0.1720633 = score(doc=5698,freq=8.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.67362815 = fieldWeight in 5698, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=5698)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages
-
Schwartz, C.: Web search engines (1998)
0.11
0.10629931 = product of:
0.15944897 = sum of:
0.0986154 = weight(_text_:search in 5700) [ClassicSimilarity], result of:
0.0986154 = score(doc=5700,freq=12.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.5643796 = fieldWeight in 5700, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=5700)
0.060833566 = product of:
0.12166713 = sum of:
0.12166713 = weight(_text_:engines in 5700) [ClassicSimilarity], result of:
0.12166713 = score(doc=5700,freq=4.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.47632706 = fieldWeight in 5700, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=5700)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- This reviews looks briefly at the history of WWW search engine development, considers the current state of affairs, and reflects on the future. Networked discovery tools have evolved along with Internet resource availability. WWW search engines display some complexity in their variety, content, resource acquisition strategies, and in the array of tools the deploy to assist users. A small but growing body of evaluation literature, much of it not systematic in nature, indicates that performance effectiveness is difficult to assess in this setting. Significant improvements in general-content search engine retrieval and ranking performance may not be possible, and are probalby not worth the effort, although search engine providers have introduced some rudimentary attempts at personalization, summarization, and query expansion. The shift to distributed search across multitype database systems could extend general networked discovery and retrieval to include smaller resource collections with rich metadata and navigation tools
-
Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014)
0.10
0.10057114 = product of:
0.1508567 = sum of:
0.09002314 = weight(_text_:search in 2799) [ClassicSimilarity], result of:
0.09002314 = score(doc=2799,freq=10.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.51520574 = fieldWeight in 2799, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=2799)
0.060833566 = product of:
0.12166713 = sum of:
0.12166713 = weight(_text_:engines in 2799) [ClassicSimilarity], result of:
0.12166713 = score(doc=2799,freq=4.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.47632706 = fieldWeight in 2799, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=2799)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- With ever increasing information being available to the end users, search engines have become the most powerful tools for obtaining useful information scattered on the Web. However, it is very common that even most renowned search engines return result sets with not so useful pages to the user. Research on semantic search aims to improve traditional information search and retrieval methods where the basic relevance criteria rely primarily on the presence of query keywords within the returned pages. This work is an attempt to explore different relevancy ranking approaches based on semantics which are considered appropriate for the retrieval of relevant information. In this paper, various pilot projects and their corresponding outcomes have been investigated based on methodologies adopted and their most distinctive characteristics towards ranking. An overview of selected approaches and their comparison by means of the classification criteria has been presented. With the help of this comparison, some common concepts and outstanding features have been identified.
-
Semantic search over the Web (2012)
0.10
0.09860971 = product of:
0.14791456 = sum of:
0.10735885 = weight(_text_:search in 411) [ClassicSimilarity], result of:
0.10735885 = score(doc=411,freq=32.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.6144187 = fieldWeight in 411, product of:
5.656854 = tf(freq=32.0), with freq of:
32.0 = termFreq=32.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.03125 = fieldNorm(doc=411)
0.04055571 = product of:
0.08111142 = sum of:
0.08111142 = weight(_text_:engines in 411) [ClassicSimilarity], result of:
0.08111142 = score(doc=411,freq=4.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.31755137 = fieldWeight in 411, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.03125 = fieldNorm(doc=411)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The Web has become the world's largest database, with search being the main tool that allows organizations and individuals to exploit its huge amount of information. Search on the Web has been traditionally based on textual and structural similarities, ignoring to a large degree the semantic dimension, i.e., understanding the meaning of the query and of the document content. Combining search and semantics gives birth to the idea of semantic search. Traditional search engines have already advertised some semantic dimensions. Some of them, for instance, can enhance their generated result sets with documents that are semantically related to the query terms even though they may not include these terms. Nevertheless, the exploitation of the semantic search has not yet reached its full potential. In this book, Roberto De Virgilio, Francesco Guerra and Yannis Velegrakis present an extensive overview of the work done in Semantic Search and other related areas. They explore different technologies and solutions in depth, making their collection a valuable and stimulating reading for both academic and industrial researchers. The book is divided into three parts. The first introduces the readers to the basic notions of the Web of Data. It describes the different kinds of data that exist, their topology, and their storing and indexing techniques. The second part is dedicated to Web Search. It presents different types of search, like the exploratory or the path-oriented, alongside methods for their efficient and effective implementation. Other related topics included in this part are the use of uncertainty in query answering, the exploitation of ontologies, and the use of semantics in mashup design and operation. The focus of the third part is on linked data, and more specifically, on applying ideas originating in recommender systems on linked data management, and on techniques for the efficiently querying answering on linked data.
- Content
- Inhalt: Introduction.- Part I Introduction to Web of Data.- Topology of the Web of Data.- Storing and Indexing Massive RDF Data Sets.- Designing Exploratory Search Applications upon Web Data Sources.- Part II Search over the Web.- Path-oriented Keyword Search query over RDF.- Interactive Query Construction for Keyword Search on the SemanticWeb.- Understanding the Semantics of Keyword Queries on Relational DataWithout Accessing the Instance.- Keyword-Based Search over Semantic Data.- Semantic Link Discovery over Relational Data.- Embracing Uncertainty in Entity Linking.- The Return of the Entity-Relationship Model: Ontological Query Answering.- Linked Data Services and Semantics-enabled Mashup.- Part III Linked Data Search engines.- A Recommender System for Linked Data.- Flint: from Web Pages to Probabilistic Semantic Data.- Searching and Browsing Linked Data with SWSE.
-
Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015)
0.09
0.08858277 = product of:
0.13287415 = sum of:
0.08217951 = weight(_text_:search in 2696) [ClassicSimilarity], result of:
0.08217951 = score(doc=2696,freq=12.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.47031635 = fieldWeight in 2696, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.05069464 = product of:
0.10138928 = sum of:
0.10138928 = weight(_text_:engines in 2696) [ClassicSimilarity], result of:
0.10138928 = score(doc=2696,freq=4.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.39693922 = fieldWeight in 2696, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Search Engines have become an integral part of our day to day life. Our reliance on search engines increases with every passing day. With the amount of data available on Internet increasing exponentially, it becomes important to develop new methods and tools that help to return results relevant to the queries and reduce the time spent on searching. The results should be diverse but at the same time should return results focused on the queries asked. Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search. The probability of finding relevance in the search results as posited by the user while entering the query is used to measure the relevance. However, its application is limited by the complexity of determining relation between the terms and assigning explicit meaning to each term. Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching. In this paper, we will provide a comparison of few ranking approaches.
-
Bergamaschi, S.; Domnori, E.; Guerra, F.; Rota, S.; Lado, R.T.; Velegrakis, Y.: Understanding the semantics of keyword queries on relational data without accessing the instance (2012)
0.09
0.08612486 = product of:
0.12918729 = sum of:
0.06709928 = weight(_text_:search in 431) [ClassicSimilarity], result of:
0.06709928 = score(doc=431,freq=8.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.3840117 = fieldWeight in 431, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=431)
0.062088005 = product of:
0.12417601 = sum of:
0.12417601 = weight(_text_:engines in 431) [ClassicSimilarity], result of:
0.12417601 = score(doc=431,freq=6.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.4861493 = fieldWeight in 431, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0390625 = fieldNorm(doc=431)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The birth of the Web has brought an exponential growth to the amount of the information that is freely available to the Internet population, overloading users and entangling their efforts to satisfy their information needs. Web search engines such Google, Yahoo, or Bing have become popular mainly due to the fact that they offer an easy-to-use query interface (i.e., based on keywords) and an effective and efficient query execution mechanism. The majority of these search engines do not consider information stored on the deep or hidden Web [9,28], despite the fact that the size of the deep Web is estimated to be much bigger than the surface Web [9,47]. There have been a number of systems that record interactions with the deep Web sources or automatically submit queries them (mainly through their Web form interfaces) in order to index their context. Unfortunately, this technique is only partially indexing the data instance. Moreover, it is not possible to take advantage of the query capabilities of data sources, for example, of the relational query features, because their interface is often restricted from the Web form. Besides, Web search engines focus on retrieving documents and not on querying structured sources, so they are unable to access information based on concepts.
- Source
- Semantic search over the Web. Eds.: R. De Virgilio, et al
-
Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016)
0.08
0.078684025 = product of:
0.11802603 = sum of:
0.08217951 = weight(_text_:search in 3188) [ClassicSimilarity], result of:
0.08217951 = score(doc=3188,freq=12.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.47031635 = fieldWeight in 3188, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.03584652 = product of:
0.07169304 = sum of:
0.07169304 = weight(_text_:engines in 3188) [ClassicSimilarity], result of:
0.07169304 = score(doc=3188,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.2806784 = fieldWeight in 3188, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Across the world, millions of users interact with search engines every day to satisfy their information needs. As the Web grows bigger over time, such information needs, manifested through user search queries, also become more complex. However, there has been no systematic study that quantifies the structural complexity of Web search queries. In this research, we make an attempt towards understanding and characterizing the syntactic complexity of search queries using a multi-pronged approach. We use traditional statistical language modeling techniques to quantify and compare the perplexity of queries with natural language (NL). We then use complex network analysis for a comparative analysis of the topological properties of queries issued by real Web users and those generated by statistical models. Finally, we conduct experiments to study whether search engine users are able to identify real queries, when presented along with model-generated ones. The three complementary studies show that the syntactic structure of Web queries is more complex than what n-grams can capture, but simpler than NL. Queries, thus, seem to represent an intermediate stage between syntactic and non-syntactic communication.
-
Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012)
0.08
0.0776466 = product of:
0.11646989 = sum of:
0.075914174 = weight(_text_:search in 428) [ClassicSimilarity], result of:
0.075914174 = score(doc=428,freq=16.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.43445963 = fieldWeight in 428, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.03125 = fieldNorm(doc=428)
0.04055571 = product of:
0.08111142 = sum of:
0.08111142 = weight(_text_:engines in 428) [ClassicSimilarity], result of:
0.08111142 = score(doc=428,freq=4.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.31755137 = fieldWeight in 428, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.03125 = fieldNorm(doc=428)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.
- Source
- Semantic search over the Web. Eds.: R. De Virgilio, et al
-
Sacco, G.M.: Dynamic taxonomies and guided searches (2006)
0.08
0.07671181 = product of:
0.11506771 = sum of:
0.08135357 = weight(_text_:search in 5295) [ClassicSimilarity], result of:
0.08135357 = score(doc=5295,freq=6.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.46558946 = fieldWeight in 5295, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=5295)
0.033714145 = product of:
0.06742829 = sum of:
0.06742829 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
0.06742829 = score(doc=5295,freq=4.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38301262 = fieldWeight in 5295, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5295)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- A new search paradigm, in which the primary user activity is the guided exploration of a complex information space rather than the retrieval of items based on precise specifications, is proposed. The author claims that this paradigm is the norm in most practical applications, and that solutions based on traditional search methods are not effective in this context. He then presents a solution based on dynamic taxonomies, a knowledge management model that effectively guides users to reach their goal while giving them total freedom in exploring the information base. Applications, benefits, and current research are discussed.
- Date
- 22. 7.2006 17:56:22
- Footnote
- Beitrag in einer Special Section "Perspectives on Search User Interfaces: Best Practices and Future Visions"
-
Scholer, F.; Williams, H.E.; Turpin, A.: Query association surrogates for Web search (2004)
0.08
0.07516497 = product of:
0.112747446 = sum of:
0.06973162 = weight(_text_:search in 2236) [ClassicSimilarity], result of:
0.06973162 = score(doc=2236,freq=6.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.39907667 = fieldWeight in 2236, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=2236)
0.043015826 = product of:
0.08603165 = sum of:
0.08603165 = weight(_text_:engines in 2236) [ClassicSimilarity], result of:
0.08603165 = score(doc=2236,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.33681408 = fieldWeight in 2236, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=2236)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Collection sizes, query rates, and the number of users of Web search engines are increasing. Therefore, there is continued demand for innovation in providing search services that meet user information needs. In this article, we propose new techniques to add additional terms to documents with the goal of providing more accurate searches. Our techniques are based an query association, where queries are stored with documents that are highly similar statistically. We show that adding query associations to documents improves the accuracy of Web topic finding searches by up to 7%, and provides an excellent complement to existing supplement techniques for site finding. We conclude that using document surrogates derived from query association is a valuable new technique for accurate Web searching.
-
Vidinli, I.B.; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine (2016)
0.08
0.07516497 = product of:
0.112747446 = sum of:
0.06973162 = weight(_text_:search in 3185) [ClassicSimilarity], result of:
0.06973162 = score(doc=3185,freq=6.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.39907667 = fieldWeight in 3185, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=3185)
0.043015826 = product of:
0.08603165 = sum of:
0.08603165 = weight(_text_:engines in 3185) [ClassicSimilarity], result of:
0.08603165 = score(doc=3185,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.33681408 = fieldWeight in 3185, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=3185)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Query suggestion is generally an integrated part of web search engines. In this study, we first redefine and reduce the query suggestion problem as "comparison of queries". We then propose a general modular framework for query suggestion algorithm development. We also develop new query suggestion algorithms which are used in our proposed framework, exploiting query, session and user features. As a case study, we use query logs of a real educational search engine that targets K-12 students in Turkey. We also exploit educational features (course, grade) in our query suggestion algorithms. We test our framework and algorithms over a set of queries by an experiment and demonstrate a 66-90% statistically significant increase in relevance of query suggestions compared to a baseline method.
-
Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006)
0.07
0.07052815 = product of:
0.105792224 = sum of:
0.08876401 = weight(_text_:search in 56) [ClassicSimilarity], result of:
0.08876401 = score(doc=56,freq=14.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.5079997 = fieldWeight in 56, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.017028214 = product of:
0.03405643 = sum of:
0.03405643 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
0.03405643 = score(doc=56,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.19345059 = fieldWeight in 56, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.
- Date
- 22. 7.2006 16:32:43
-
Rekabsaz, N. et al.: Toward optimized multimodal concept indexing (2016)
0.07
0.06743714 = product of:
0.10115571 = sum of:
0.06709928 = weight(_text_:search in 2751) [ClassicSimilarity], result of:
0.06709928 = score(doc=2751,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.3840117 = fieldWeight in 2751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.078125 = fieldNorm(doc=2751)
0.03405643 = product of:
0.06811286 = sum of:
0.06811286 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
0.06811286 = score(doc=2751,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38690117 = fieldWeight in 2751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2751)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Date
- 1. 2.2016 18:25:22
- Source
- Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al
-
Kozikowski, P. et al.: Support of part-whole relations in query answering (2016)
0.07
0.06743714 = product of:
0.10115571 = sum of:
0.06709928 = weight(_text_:search in 2754) [ClassicSimilarity], result of:
0.06709928 = score(doc=2754,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.3840117 = fieldWeight in 2754, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.078125 = fieldNorm(doc=2754)
0.03405643 = product of:
0.06811286 = sum of:
0.06811286 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
0.06811286 = score(doc=2754,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38690117 = fieldWeight in 2754, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2754)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Date
- 1. 2.2016 18:25:22
- Source
- Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al
-
Marx, E. et al.: Exploring term networks for semantic search over RDF knowledge graphs (2016)
0.07
0.06743714 = product of:
0.10115571 = sum of:
0.06709928 = weight(_text_:search in 3279) [ClassicSimilarity], result of:
0.06709928 = score(doc=3279,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.3840117 = fieldWeight in 3279, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.078125 = fieldNorm(doc=3279)
0.03405643 = product of:
0.06811286 = sum of:
0.06811286 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
0.06811286 = score(doc=3279,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38690117 = fieldWeight in 3279, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=3279)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Source
- Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
-
Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996)
0.06
0.060176264 = product of:
0.090264395 = sum of:
0.0664249 = weight(_text_:search in 6958) [ClassicSimilarity], result of:
0.0664249 = score(doc=6958,freq=4.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.38015217 = fieldWeight in 6958, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=6958)
0.0238395 = product of:
0.047679 = sum of:
0.047679 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
0.047679 = score(doc=6958,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.2708308 = fieldWeight in 6958, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=6958)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Reports on the design of a GUI for the Okapi 'best match' retrieval system developed at the Centre for Interactive Systems Research, City University, UK, for online library catalogues. The X-Windows interface includes an interactive query expansion (IQE) facilty which involves the user in the selection of query terms to reformulate a search. Presents the design rationale, based on a game board metaphor, and describes the features of each of the stages of the search interaction. Reports on the early operational field trial and discusses relevant evaluation issues and objectives
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Thenmalar, S.; Geetha, T.V.: Enhanced ontology-based indexing and searching (2014)
0.06
0.05987324 = product of:
0.08980986 = sum of:
0.077890106 = weight(_text_:search in 1633) [ClassicSimilarity], result of:
0.077890106 = score(doc=1633,freq=22.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.44576794 = fieldWeight in 1633, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.02734375 = fieldNorm(doc=1633)
0.01191975 = product of:
0.0238395 = sum of:
0.0238395 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
0.0238395 = score(doc=1633,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.1354154 = fieldWeight in 1633, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02734375 = fieldNorm(doc=1633)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Purpose - The purpose of this paper is to improve the conceptual-based search by incorporating structural ontological information such as concepts and relations. Generally, Semantic-based information retrieval aims to identify relevant information based on the meanings of the query terms or on the context of the terms and the performance of semantic information retrieval is carried out through standard measures-precision and recall. Higher precision leads to the (meaningful) relevant documents obtained and lower recall leads to the less coverage of the concepts. Design/methodology/approach - In this paper, the authors enhance the existing ontology-based indexing proposed by Kohler et al., by incorporating sibling information to the index. The index designed by Kohler et al., contains only super and sub-concepts from the ontology. In addition, in our approach, we focus on two tasks; query expansion and ranking of the expanded queries, to improve the efficiency of the ontology-based search. The aforementioned tasks make use of ontological concepts, and relations existing between those concepts so as to obtain semantically more relevant search results for a given query. Findings - The proposed ontology-based indexing technique is investigated by analysing the coverage of concepts that are being populated in the index. Here, we introduce a new measure called index enhancement measure, to estimate the coverage of ontological concepts being indexed. We have evaluated the ontology-based search for the tourism domain with the tourism documents and tourism-specific ontology. The comparison of search results based on the use of ontology "with and without query expansion" is examined to estimate the efficiency of the proposed query expansion task. The ranking is compared with the ORank system to evaluate the performance of our ontology-based search. From these analyses, the ontology-based search results shows better recall when compared to the other concept-based search systems. The mean average precision of the ontology-based search is found to be 0.79 and the recall is found to be 0.65, the ORank system has the mean average precision of 0.62 and the recall is found to be 0.51, while the concept-based search has the mean average precision of 0.56 and the recall is found to be 0.42. Practical implications - When the concept is not present in the domain-specific ontology, the concept cannot be indexed. When the given query term is not available in the ontology then the term-based results are retrieved. Originality/value - In addition to super and sub-concepts, we incorporate the concepts present in same level (siblings) to the ontological index. The structural information from the ontology is determined for the query expansion. The ranking of the documents depends on the type of the query (single concept query, multiple concept queries and concept with relation queries) and the ontological relations that exists in the query and the documents. With this ontological structural information, the search results showed us better coverage of concepts with respect to the query.
- Date
- 20. 1.2015 18:30:22
-
Prasad, A.R.D.; Madalli, D.P.: Faceted infrastructure for semantic digital libraries (2008)
0.06
0.05552859 = product of:
0.08329288 = sum of:
0.04744636 = weight(_text_:search in 1905) [ClassicSimilarity], result of:
0.04744636 = score(doc=1905,freq=4.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.27153727 = fieldWeight in 1905, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=1905)
0.03584652 = product of:
0.07169304 = sum of:
0.07169304 = weight(_text_:engines in 1905) [ClassicSimilarity], result of:
0.07169304 = score(doc=1905,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.2806784 = fieldWeight in 1905, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0390625 = fieldNorm(doc=1905)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Purpose - The paper aims to argue that digital library retrieval should be based on semantic representations and propose a semantic infrastructure for digital libraries. Design/methodology/approach - The approach taken is formal model based on subject representation for digital libraries. Findings - Search engines and search techniques have fallen short of user expectations as they do not give context based retrieval. Deploying semantic web technologies would lead to efficient and more precise representation of digital library content and hence better retrieval. Though digital libraries often have metadata of information resources which can be accessed through OAI-PMH, much remains to be accomplished in making digital libraries semantic web compliant. This paper presents a semantic infrastructure for digital libraries, that will go a long way in providing them and web based information services with products highly customised to users needs. Research limitations/implications - Here only a model for semantic infrastructure is proposed. This model is proposed after studying current user-centric, top-down models adopted in digital library service architectures. Originality/value - This paper gives a generic model for building semantic infrastructure for digital libraries. Faceted ontologies for digital libraries is just one approach. But the same may be adopted by groups working with different approaches in building ontologies to realise efficient retrieval in digital libraries.
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.05
0.051579654 = product of:
0.07736948 = sum of:
0.056935627 = weight(_text_:search in 2419) [ClassicSimilarity], result of:
0.056935627 = score(doc=2419,freq=4.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.3258447 = fieldWeight in 2419, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.020433856 = product of:
0.040867712 = sum of:
0.040867712 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.040867712 = score(doc=2419,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.23214069 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.
- Date
- 16.11.2008 16:22:48
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.05
0.047206 = product of:
0.070809 = sum of:
0.0469695 = weight(_text_:search in 1319) [ClassicSimilarity], result of:
0.0469695 = score(doc=1319,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.2688082 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.0238395 = product of:
0.047679 = sum of:
0.047679 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.047679 = score(doc=1319,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.2708308 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
- Date
- 1. 8.1996 22:08:06
