-
Mayr, P.; Schaer, P.; Mutschke, P.: ¬A science model driven retrieval prototype (2011)
0.14
0.1392412 = product of:
0.18565494 = sum of:
0.009988121 = product of:
0.039952483 = sum of:
0.039952483 = weight(_text_:based in 649) [ClassicSimilarity], result of:
0.039952483 = score(doc=649,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.28246817 = fieldWeight in 649, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=649)
0.25 = coord(1/4)
0.06775281 = weight(_text_:term in 649) [ClassicSimilarity], result of:
0.06775281 = score(doc=649,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.309317 = fieldWeight in 649, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=649)
0.107914 = weight(_text_:frequency in 649) [ClassicSimilarity], result of:
0.107914 = score(doc=649,freq=2.0), product of:
0.27643865 = queryWeight, product of:
5.888745 = idf(docFreq=332, maxDocs=44218)
0.04694356 = queryNorm
0.39037234 = fieldWeight in 649, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.888745 = idf(docFreq=332, maxDocs=44218)
0.046875 = fieldNorm(doc=649)
0.75 = coord(3/4)
- Abstract
- This paper is about a better understanding of the structure and dynamics of science and the usage of these insights for compensating the typical problems that arises in metadata-driven Digital Libraries. Three science model driven retrieval services are presented: co-word analysis based query expansion, re-ranking via Bradfordizing and author centrality. The services are evaluated with relevance assessments from which two important implications emerge: (1) precision values of the retrieval services are the same or better than the tf-idf retrieval baseline and (2) each service retrieved a disjoint set of documents. The different services each favor quite other - but still relevant - documents than pure term-frequency based rankings. The proposed models and derived retrieval services therefore open up new viewpoints on the scientific knowledge space and provide an alternative framework to structure scholarly information systems.
-
Brandão, W.C.; Santos, R.L.T.; Ziviani, N.; Moura, E.S. de; Silva, A.S. da: Learning to expand queries using entities (2014)
0.12
0.12171714 = product of:
0.16228952 = sum of:
0.056460675 = weight(_text_:term in 1343) [ClassicSimilarity], result of:
0.056460675 = score(doc=1343,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.25776416 = fieldWeight in 1343, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=1343)
0.08992833 = weight(_text_:frequency in 1343) [ClassicSimilarity], result of:
0.08992833 = score(doc=1343,freq=2.0), product of:
0.27643865 = queryWeight, product of:
5.888745 = idf(docFreq=332, maxDocs=44218)
0.04694356 = queryNorm
0.32531026 = fieldWeight in 1343, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.888745 = idf(docFreq=332, maxDocs=44218)
0.0390625 = fieldNorm(doc=1343)
0.015900511 = product of:
0.031801023 = sum of:
0.031801023 = weight(_text_:22 in 1343) [ClassicSimilarity], result of:
0.031801023 = score(doc=1343,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.19345059 = fieldWeight in 1343, 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=1343)
0.5 = coord(1/2)
0.75 = coord(3/4)
- Abstract
- A substantial fraction of web search queries contain references to entities, such as persons, organizations, and locations. Recently, methods that exploit named entities have been shown to be more effective for query expansion than traditional pseudorelevance feedback methods. In this article, we introduce a supervised learning approach that exploits named entities for query expansion using Wikipedia as a repository of high-quality feedback documents. In contrast with existing entity-oriented pseudorelevance feedback approaches, we tackle query expansion as a learning-to-rank problem. As a result, not only do we select effective expansion terms but we also weigh these terms according to their predicted effectiveness. To this end, we exploit the rich structure of Wikipedia articles to devise discriminative term features, including each candidate term's proximity to the original query terms, as well as its frequency across multiple article fields and in category and infobox descriptors. Experiments on three Text REtrieval Conference web test collections attest the effectiveness of our approach, with gains of up to 23.32% in terms of mean average precision, 19.49% in terms of precision at 10, and 7.86% in terms of normalized discounted cumulative gain compared with a state-of-the-art approach for entity-oriented query expansion.
- Date
- 22. 8.2014 17:07:50
-
Marx, E. et al.: Exploring term networks for semantic search over RDF knowledge graphs (2016)
0.07
0.072361186 = product of:
0.14472237 = sum of:
0.11292135 = weight(_text_:term in 3279) [ClassicSimilarity], result of:
0.11292135 = score(doc=3279,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.5155283 = fieldWeight in 3279, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.078125 = fieldNorm(doc=3279)
0.031801023 = product of:
0.063602045 = sum of:
0.063602045 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
0.063602045 = score(doc=3279,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = 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.5 = coord(2/4)
- Source
- Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
-
Kopácsi, S. et al.: Development of a classification server to support metadata harmonization in a long term preservation system (2016)
0.07
0.072361186 = product of:
0.14472237 = sum of:
0.11292135 = weight(_text_:term in 3280) [ClassicSimilarity], result of:
0.11292135 = score(doc=3280,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.5155283 = fieldWeight in 3280, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.078125 = fieldNorm(doc=3280)
0.031801023 = product of:
0.063602045 = sum of:
0.063602045 = weight(_text_:22 in 3280) [ClassicSimilarity], result of:
0.063602045 = score(doc=3280,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.38690117 = fieldWeight in 3280, 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=3280)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Source
- Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
-
Xu, B.; Lin, H.; Lin, Y.: Assessment of learning to rank methods for query expansion (2016)
0.07
0.06865833 = product of:
0.13731666 = sum of:
0.09779277 = weight(_text_:term in 2929) [ClassicSimilarity], result of:
0.09779277 = score(doc=2929,freq=6.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.44646066 = fieldWeight in 2929, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=2929)
0.039523892 = product of:
0.079047784 = sum of:
0.079047784 = weight(_text_:assessment in 2929) [ClassicSimilarity], result of:
0.079047784 = score(doc=2929,freq=2.0), product of:
0.25917634 = queryWeight, product of:
5.52102 = idf(docFreq=480, maxDocs=44218)
0.04694356 = queryNorm
0.30499613 = fieldWeight in 2929, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.52102 = idf(docFreq=480, maxDocs=44218)
0.0390625 = fieldNorm(doc=2929)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Pseudo relevance feedback, as an effective query expansion method, can significantly improve information retrieval performance. However, the method may negatively impact the retrieval performance when some irrelevant terms are used in the expanded query. Therefore, it is necessary to refine the expansion terms. Learning to rank methods have proven effective in information retrieval to solve ranking problems by ranking the most relevant documents at the top of the returned list, but few attempts have been made to employ learning to rank methods for term refinement in pseudo relevance feedback. This article proposes a novel framework to explore the feasibility of using learning to rank to optimize pseudo relevance feedback by means of reranking the candidate expansion terms. We investigate some learning approaches to choose the candidate terms and introduce some state-of-the-art learning to rank methods to refine the expansion terms. In addition, we propose two term labeling strategies and examine the usefulness of various term features to optimize the framework. Experimental results with three TREC collections show that our framework can effectively improve retrieval performance.
-
Li, N.; Sun, J.: Improving Chinese term association from the linguistic perspective (2017)
0.06
0.06366972 = product of:
0.12733944 = sum of:
0.009988121 = product of:
0.039952483 = sum of:
0.039952483 = weight(_text_:based in 3381) [ClassicSimilarity], result of:
0.039952483 = score(doc=3381,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.28246817 = fieldWeight in 3381, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=3381)
0.25 = coord(1/4)
0.117351316 = weight(_text_:term in 3381) [ClassicSimilarity], result of:
0.117351316 = score(doc=3381,freq=6.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.5357528 = fieldWeight in 3381, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=3381)
0.5 = coord(2/4)
- Abstract
- The study aims to solve how to construct the semantic relations of specific domain terms by applying linguistic rules. The semantic structure analysis at the morpheme level was used for semantic measure, and a morpheme-based term association model was proposed by improving and combining the literal-based similarity algorithm and co-occurrence relatedness methods. This study provides a novel insight into the method of semantic analysis and calculation by morpheme parsing, and the proposed solution is feasible for the automatic association of compound terms. The results show that this approach could be used to construct appropriate term association and form a reasonable structural knowledge graph. However, due to linguistic differences, the viability and effectiveness of the use of our method in non-Chinese linguistic environments should be verified.
-
Thenmalar, S.; Geetha, T.V.: Enhanced ontology-based indexing and searching (2014)
0.06
0.06223488 = product of:
0.082979836 = sum of:
0.015956266 = product of:
0.06382506 = sum of:
0.06382506 = weight(_text_:based in 1633) [ClassicSimilarity], result of:
0.06382506 = score(doc=1633,freq=30.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.45124975 = fieldWeight in 1633, product of:
5.477226 = tf(freq=30.0), with freq of:
30.0 = termFreq=30.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.02734375 = fieldNorm(doc=1633)
0.25 = coord(1/4)
0.055893216 = weight(_text_:term in 1633) [ClassicSimilarity], result of:
0.055893216 = score(doc=1633,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.2551735 = fieldWeight in 1633, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.02734375 = fieldNorm(doc=1633)
0.011130357 = product of:
0.022260714 = sum of:
0.022260714 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
0.022260714 = score(doc=1633,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = 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.75 = coord(3/4)
- 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
-
Colace, F.; Santo, M. de; Greco, L.; Napoletano, P.: Improving relevance feedback-based query expansion by the use of a weighted word pairs approach (2015)
0.05
0.052902535 = product of:
0.10580507 = sum of:
0.009988121 = product of:
0.039952483 = sum of:
0.039952483 = weight(_text_:based in 2263) [ClassicSimilarity], result of:
0.039952483 = score(doc=2263,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.28246817 = fieldWeight in 2263, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=2263)
0.25 = coord(1/4)
0.09581695 = weight(_text_:term in 2263) [ClassicSimilarity], result of:
0.09581695 = score(doc=2263,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.4374403 = fieldWeight in 2263, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=2263)
0.5 = coord(2/4)
- Abstract
- In this article, the use of a new term extraction method for query expansion (QE) in text retrieval is investigated. The new method expands the initial query with a structured representation made of weighted word pairs (WWP) extracted from a set of training documents (relevance feedback). Standard text retrieval systems can handle a WWP structure through custom Boolean weighted models. We experimented with both the explicit and pseudorelevance feedback schemas and compared the proposed term extraction method with others in the literature, such as KLD and RM3. Evaluations have been conducted on a number of test collections (Text REtrivel Conference [TREC]-6, -7, -8, -9, and -10). Results demonstrated that the QE method based on this new structure outperforms the baseline.
-
Blanco, R.; Matthews, M.; Mika, P.: Ranking of daily deals with concept expansion (2015)
0.05
0.052902535 = product of:
0.10580507 = sum of:
0.009988121 = product of:
0.039952483 = sum of:
0.039952483 = weight(_text_:based in 2663) [ClassicSimilarity], result of:
0.039952483 = score(doc=2663,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.28246817 = fieldWeight in 2663, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=2663)
0.25 = coord(1/4)
0.09581695 = weight(_text_:term in 2663) [ClassicSimilarity], result of:
0.09581695 = score(doc=2663,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.4374403 = fieldWeight in 2663, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=2663)
0.5 = coord(2/4)
- Abstract
- Daily deals have emerged in the last three years as a successful form of online advertising. The downside of this success is that users are increasingly overloaded by the many thousands of deals offered each day by dozens of deal providers and aggregators. The challenge is thus offering the right deals to the right users i.e., the relevance ranking of deals. This is the problem we address in our paper. Exploiting the characteristics of deals data, we propose a combination of a term- and a concept-based retrieval model that closes the semantic gap between queries and documents expanding both of them with category information. The method consistently outperforms state-of-the-art methods based on term-matching alone and existing approaches for ad classification and ranking.
-
Cai, F.; Rijke, M. de: Learning from homologous queries and semantically related terms for query auto completion (2016)
0.05
0.047906943 = product of:
0.095813885 = sum of:
0.005885557 = product of:
0.023542227 = sum of:
0.023542227 = weight(_text_:based in 2971) [ClassicSimilarity], result of:
0.023542227 = score(doc=2971,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.16644597 = fieldWeight in 2971, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=2971)
0.25 = coord(1/4)
0.08992833 = weight(_text_:frequency in 2971) [ClassicSimilarity], result of:
0.08992833 = score(doc=2971,freq=2.0), product of:
0.27643865 = queryWeight, product of:
5.888745 = idf(docFreq=332, maxDocs=44218)
0.04694356 = queryNorm
0.32531026 = fieldWeight in 2971, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.888745 = idf(docFreq=332, maxDocs=44218)
0.0390625 = fieldNorm(doc=2971)
0.5 = coord(2/4)
- Abstract
- Query auto completion (QAC) models recommend possible queries to web search users when they start typing a query prefix. Most of today's QAC models rank candidate queries by popularity (i.e., frequency), and in doing so they tend to follow a strict query matching policy when counting the queries. That is, they ignore the contributions from so-called homologous queries, queries with the same terms but ordered differently or queries that expand the original query. Importantly, homologous queries often express a remarkably similar search intent. Moreover, today's QAC approaches often ignore semantically related terms. We argue that users are prone to combine semantically related terms when generating queries. We propose a learning to rank-based QAC approach, where, for the first time, features derived from homologous queries and semantically related terms are introduced. In particular, we consider: (i) the observed and predicted popularity of homologous queries for a query candidate; and (ii) the semantic relatedness of pairs of terms inside a query and pairs of queries inside a session. We quantify the improvement of the proposed new features using two large-scale real-world query logs and show that the mean reciprocal rank and the success rate can be improved by up to 9% over state-of-the-art QAC models.
-
Jiang, Y.; Zhang, X.; Tang, Y.; Nie, R.: Feature-based approaches to semantic similarity assessment of concepts using Wikipedia (2015)
0.05
0.047309753 = product of:
0.094619505 = sum of:
0.01557172 = product of:
0.06228688 = sum of:
0.06228688 = weight(_text_:based in 2682) [ClassicSimilarity], result of:
0.06228688 = score(doc=2682,freq=14.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.44037464 = fieldWeight in 2682, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=2682)
0.25 = coord(1/4)
0.079047784 = product of:
0.15809557 = sum of:
0.15809557 = weight(_text_:assessment in 2682) [ClassicSimilarity], result of:
0.15809557 = score(doc=2682,freq=8.0), product of:
0.25917634 = queryWeight, product of:
5.52102 = idf(docFreq=480, maxDocs=44218)
0.04694356 = queryNorm
0.60999227 = fieldWeight in 2682, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
5.52102 = idf(docFreq=480, maxDocs=44218)
0.0390625 = fieldNorm(doc=2682)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Semantic similarity assessment between concepts is an important task in many language related applications. In the past, several approaches to assess similarity by evaluating the knowledge modeled in an (or multiple) ontology (or ontologies) have been proposed. However, there are some limitations such as the facts of relying on predefined ontologies and fitting non-dynamic domains in the existing measures. Wikipedia provides a very large domain-independent encyclopedic repository and semantic network for computing semantic similarity of concepts with more coverage than usual ontologies. In this paper, we propose some novel feature based similarity assessment methods that are fully dependent on Wikipedia and can avoid most of the limitations and drawbacks introduced above. To implement similarity assessment based on feature by making use of Wikipedia, firstly a formal representation of Wikipedia concepts is presented. We then give a framework for feature based similarity based on the formal representation of Wikipedia concepts. Lastly, we investigate several feature based approaches to semantic similarity measures resulting from instantiations of the framework. The evaluation, based on several widely used benchmarks and a benchmark developed in ourselves, sustains the intuitions with respect to human judgements. Overall, several methods proposed in this paper have good human correlation and constitute some effective ways of determining similarity between Wikipedia concepts.
-
Ma, N.; Zheng, H.T.; Xiao, X.: ¬An ontology-based latent semantic indexing approach using long short-term memory networks (2017)
0.04
0.044085447 = product of:
0.08817089 = sum of:
0.008323434 = product of:
0.033293735 = sum of:
0.033293735 = weight(_text_:based in 3810) [ClassicSimilarity], result of:
0.033293735 = score(doc=3810,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.23539014 = fieldWeight in 3810, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=3810)
0.25 = coord(1/4)
0.07984746 = weight(_text_:term in 3810) [ClassicSimilarity], result of:
0.07984746 = score(doc=3810,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.3645336 = fieldWeight in 3810, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=3810)
0.5 = coord(2/4)
- Abstract
- Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologies. In this paper, we propose an Ontology-based Latent Semantic Indexing approach utilizing Long Short-Term Memory networks (LSTM-OLSI). We utilize an importance-aware topic model to extract document-level semantic features and leverage ontologies to extract word-level contextual features. Then we encode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.
-
Layfield, C.; Azzopardi, J,; Staff, C.: Experiments with document retrieval from small text collections using Latent Semantic Analysis or term similarity with query coordination and automatic relevance feedback (2017)
0.04
0.04147133 = product of:
0.08294266 = sum of:
0.0047084456 = product of:
0.018833783 = sum of:
0.018833783 = weight(_text_:based in 3478) [ClassicSimilarity], result of:
0.018833783 = score(doc=3478,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.13315678 = fieldWeight in 3478, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.03125 = fieldNorm(doc=3478)
0.25 = coord(1/4)
0.07823421 = weight(_text_:term in 3478) [ClassicSimilarity], result of:
0.07823421 = score(doc=3478,freq=6.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.35716853 = fieldWeight in 3478, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.03125 = fieldNorm(doc=3478)
0.5 = coord(2/4)
- Abstract
- One of the problems faced by users of databases containing textual documents is the difficulty in retrieving relevant results due to the diverse vocabulary used in queries and contained in relevant documents, especially when there are only a small number of relevant documents. This problem is known as the Vocabulary Gap. The PIKES team have constructed a small test collection of 331 articles extracted from a blog and a Gold Standard for 35 queries selected from the blog's search log so the results of different approaches to semantic search can be compared. So far, prior approaches include recognising Named Entities in documents and queries, and relations including temporal relations, and represent them as `semantic layers' in a retrieval system index. In this work, we take two different approaches that do not involve Named Entity Recognition. In the first approach, we process an unannotated version of the PIKES document collection using Latent Semantic Analysis and use a combination of query coordination and automatic relevance feedback with which we outperform prior work. However, this approach is highly dependent on the underlying collection, and is not necessarily scalable to massive collections. In our second approach, we use an LSA Model generated by SEMILAR from a Wikipedia dump to generate a Term Similarity Matrix (TSM). We automatically expand the queries in the PIKES test collection with related terms from the TSM and submit them to a term-by-document matrix derived by indexing the PIKES collection using the Vector Space Model. Coupled with a combination of query coordination and automatic relevance feedback we also outperform prior work with this approach. The advantage of the second approach is that it is independent of the underlying document collection.
- Source
- Semantic keyword-based search on structured data sources: COST Action IC1302. Second International KEYSTONE Conference, IKC 2016, Cluj-Napoca, Romania, September 8-9, 2016, Revised Selected Papers. Eds.: A. Calì, A. et al
-
Goslin, K.; Hofmann, M.: ¬A Wikipedia powered state-based approach to automatic search query enhancement (2018)
0.04
0.037407737 = product of:
0.074815474 = sum of:
0.0070626684 = product of:
0.028250674 = sum of:
0.028250674 = weight(_text_:based in 5083) [ClassicSimilarity], result of:
0.028250674 = score(doc=5083,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.19973516 = fieldWeight in 5083, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=5083)
0.25 = coord(1/4)
0.06775281 = weight(_text_:term in 5083) [ClassicSimilarity], result of:
0.06775281 = score(doc=5083,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.309317 = fieldWeight in 5083, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.046875 = fieldNorm(doc=5083)
0.5 = coord(2/4)
- Abstract
- This paper describes the development and testing of a novel Automatic Search Query Enhancement (ASQE) algorithm, the Wikipedia N Sub-state Algorithm (WNSSA), which utilises Wikipedia as the sole data source for prior knowledge. This algorithm is built upon the concept of iterative states and sub-states, harnessing the power of Wikipedia's data set and link information to identify and utilise reoccurring terms to aid term selection and weighting during enhancement. This algorithm is designed to prevent query drift by making callbacks to the user's original search intent by persisting the original query between internal states with additional selected enhancement terms. The developed algorithm has shown to improve both short and long queries by providing a better understanding of the query and available data. The proposed algorithm was compared against five existing ASQE algorithms that utilise Wikipedia as the sole data source, showing an average Mean Average Precision (MAP) improvement of 0.273 over the tested existing ASQE algorithms.
-
Pal, D.; Mitra, M.; Datta, K.: Improving query expansion using WordNet (2014)
0.03
0.034115896 = product of:
0.06823179 = sum of:
0.011771114 = product of:
0.047084454 = sum of:
0.047084454 = weight(_text_:based in 1545) [ClassicSimilarity], result of:
0.047084454 = score(doc=1545,freq=8.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.33289194 = fieldWeight in 1545, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=1545)
0.25 = coord(1/4)
0.056460675 = weight(_text_:term in 1545) [ClassicSimilarity], result of:
0.056460675 = score(doc=1545,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.25776416 = fieldWeight in 1545, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=1545)
0.5 = coord(2/4)
- Abstract
- This study proposes a new way of using WordNet for query expansion (QE). We choose candidate expansion terms from a set of pseudo-relevant documents; however, the usefulness of these terms is measured based on their definitions provided in a hand-crafted lexical resource such as WordNet. Experiments with a number of standard TREC collections WordNet-based that this method outperforms existing WordNet-based methods. It also compares favorably with established QE methods such as KLD and RM3. Leveraging earlier work in which a combination of QE methods was found to outperform each individual method (as well as other well-known QE methods), we next propose a combination-based QE method that takes into account three different aspects of a candidate expansion term's usefulness: (a) its distribution in the pseudo-relevant documents and in the target corpus, (b) its statistical association with query terms, and (c) its semantic relation with the query, as determined by the overlap between the WordNet definitions of the term and query terms. This combination of diverse sources of information appears to work well on a number of test collections, viz., TREC123, TREC5, TREC678, TREC robust (new), and TREC910 collections, and yields significant improvements over competing methods on most of these collections.
-
Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015)
0.03
0.031173116 = product of:
0.06234623 = sum of:
0.005885557 = product of:
0.023542227 = sum of:
0.023542227 = weight(_text_:based in 2696) [ClassicSimilarity], result of:
0.023542227 = score(doc=2696,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.16644597 = fieldWeight in 2696, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.25 = coord(1/4)
0.056460675 = weight(_text_:term in 2696) [ClassicSimilarity], result of:
0.056460675 = score(doc=2696,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.25776416 = fieldWeight in 2696, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.5 = coord(2/4)
- 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.
-
Ru, C.; Tang, J.; Li, S.; Xie, S.; Wang, T.: Using semantic similarity to reduce wrong labels in distant supervision for relation extraction (2018)
0.03
0.031173116 = product of:
0.06234623 = sum of:
0.005885557 = product of:
0.023542227 = sum of:
0.023542227 = weight(_text_:based in 5055) [ClassicSimilarity], result of:
0.023542227 = score(doc=5055,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.16644597 = fieldWeight in 5055, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=5055)
0.25 = coord(1/4)
0.056460675 = weight(_text_:term in 5055) [ClassicSimilarity], result of:
0.056460675 = score(doc=5055,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.25776416 = fieldWeight in 5055, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=5055)
0.5 = coord(2/4)
- Abstract
- Distant supervision (DS) has the advantage of automatically generating large amounts of labelled training data and has been widely used for relation extraction. However, there are usually many wrong labels in the automatically labelled data in distant supervision (Riedel, Yao, & McCallum, 2010). This paper presents a novel method to reduce the wrong labels. The proposed method uses the semantic Jaccard with word embedding to measure the semantic similarity between the relation phrase in the knowledge base and the dependency phrases between two entities in a sentence to filter the wrong labels. In the process of reducing wrong labels, the semantic Jaccard algorithm selects a core dependency phrase to represent the candidate relation in a sentence, which can capture features for relation classification and avoid the negative impact from irrelevant term sequences that previous neural network models of relation extraction often suffer. In the process of relation classification, the core dependency phrases are also used as the input of a convolutional neural network (CNN) for relation classification. The experimental results show that compared with the methods using original DS data, the methods using filtered DS data performed much better in relation extraction. It indicates that the semantic similarity based method is effective in reducing wrong labels. The relation extraction performance of the CNN model using the core dependency phrases as input is the best of all, which indicates that using the core dependency phrases as input of CNN is enough to capture the features for relation classification and could avoid negative impact from irrelevant terms.
-
Olmos, R.; Jorge-Botana, G.; Luzón, J.M.; Martín-Cordero, J.I.; León, J.A.: Transforming LSA space dimensions into a rubric for an automatic assessment and feedback system (2016)
0.02
0.023923663 = product of:
0.047847327 = sum of:
0.008323434 = product of:
0.033293735 = sum of:
0.033293735 = weight(_text_:based in 2878) [ClassicSimilarity], result of:
0.033293735 = score(doc=2878,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.23539014 = fieldWeight in 2878, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0390625 = fieldNorm(doc=2878)
0.25 = coord(1/4)
0.039523892 = product of:
0.079047784 = sum of:
0.079047784 = weight(_text_:assessment in 2878) [ClassicSimilarity], result of:
0.079047784 = score(doc=2878,freq=2.0), product of:
0.25917634 = queryWeight, product of:
5.52102 = idf(docFreq=480, maxDocs=44218)
0.04694356 = queryNorm
0.30499613 = fieldWeight in 2878, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.52102 = idf(docFreq=480, maxDocs=44218)
0.0390625 = fieldNorm(doc=2878)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The purpose of this article is to validate, through two empirical studies, a new method for automatic evaluation of written texts, called Inbuilt Rubric, based on the Latent Semantic Analysis (LSA) technique, which constitutes an innovative and distinct turn with respect to LSA application so far. In the first empirical study, evidence of the validity of the method to identify and evaluate the conceptual axes of a text in a sample of 78 summaries by secondary school students is sought. Results show that the proposed method has a significantly higher degree of reliability than classic LSA methods of text evaluation, and displays very high sensitivity to identify which conceptual axes are included or not in each summary. A second study evaluates the method's capacity to interact and provide feedback about quality in a real online system on a sample of 924 discursive texts written by university students. Results show that students improved the quality of their written texts using this system, and also rated the experience very highly. The final conclusion is that this new method opens a very interesting way regarding the role of automatic assessors in the identification of presence/absence and quality of elaboration of relevant conceptual information in texts written by students with lower time costs than the usual LSA-based methods.
-
Rekabsaz, N. et al.: Toward optimized multimodal concept indexing (2016)
0.02
0.021786068 = product of:
0.043572135 = sum of:
0.011771114 = product of:
0.047084454 = sum of:
0.047084454 = weight(_text_:based in 2751) [ClassicSimilarity], result of:
0.047084454 = score(doc=2751,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.33289194 = fieldWeight in 2751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.078125 = fieldNorm(doc=2751)
0.25 = coord(1/4)
0.031801023 = product of:
0.063602045 = sum of:
0.063602045 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
0.063602045 = score(doc=2751,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = 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.5 = coord(2/4)
- 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.02
0.021786068 = product of:
0.043572135 = sum of:
0.011771114 = product of:
0.047084454 = sum of:
0.047084454 = weight(_text_:based in 2754) [ClassicSimilarity], result of:
0.047084454 = score(doc=2754,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.33289194 = fieldWeight in 2754, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.078125 = fieldNorm(doc=2754)
0.25 = coord(1/4)
0.031801023 = product of:
0.063602045 = sum of:
0.063602045 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
0.063602045 = score(doc=2754,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = 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.5 = coord(2/4)
- 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
