scholarly journals Understanding Users Intent by Deducing Domain Knowledge Hidden in Web Search Query Keywords

2013 ◽  
Vol 67 (15) ◽  
pp. 17-20
Author(s):  
Nachiket BhagwantKamat ◽  
Geeta Varkey
2017 ◽  
pp. 030-050
Author(s):  
J.V. Rogushina ◽  

Problems associated with the improve ment of information retrieval for open environment are considered and the need for it’s semantization is grounded. Thecurrent state and prospects of development of semantic search engines that are focused on the Web information resources processing are analysed, the criteria for the classification of such systems are reviewed. In this analysis the significant attention is paid to the semantic search use of ontologies that contain knowledge about the subject area and the search users. The sources of ontological knowledge and methods of their processing for the improvement of the search procedures are considered. Examples of semantic search systems that use structured query languages (eg, SPARQL), lists of keywords and queries in natural language are proposed. Such criteria for the classification of semantic search engines like architecture, coupling, transparency, user context, modification requests, ontology structure, etc. are considered. Different ways of support of semantic and otology based modification of user queries that improve the completeness and accuracy of the search are analyzed. On base of analysis of the properties of existing semantic search engines in terms of these criteria, the areas for further improvement of these systems are selected: the development of metasearch systems, semantic modification of user requests, the determination of an user-acceptable transparency level of the search procedures, flexibility of domain knowledge management tools, increasing productivity and scalability. In addition, the development of means of semantic Web search needs in use of some external knowledge base which contains knowledge about the domain of user information needs, and in providing the users with the ability to independent selection of knowledge that is used in the search process. There is necessary to take into account the history of user interaction with the retrieval system and the search context for personalization of the query results and their ordering in accordance with the user information needs. All these aspects were taken into account in the design and implementation of semantic search engine "MAIPS" that is based on an ontological model of users and resources cooperation into the Web.


2009 ◽  
pp. 3491-3493
Author(s):  
Rosie Jones ◽  
Fuchun Peng

Author(s):  
Carsten Eickhoff ◽  
Tamara Polajnar ◽  
Karl Gyllstrom ◽  
Sergio Duarte Torres ◽  
Richard Glassey

Author(s):  
Jun Zhang ◽  
Xiangfeng Luo ◽  
Lei Lu ◽  
Weidong Liu

The acquisition of deep textual semantics is a key issue which significantly improves the performances of e-learning, web search and web knowledge services, etc. Though many models have been developed to acquire textual semantics, the acquisition of deep textual semantics is still a challenge issue. Herein, an acquisition model of deep textual semantics is developed to enhance the capability of text understanding, which includes two parts: 1) how to obtain and organize the domain knowledge extracted from text set and 2) how to activate the domain knowledge for obtaining the deep textual semantics. The activation process involves the Gough mode reading theory, Landscape model and memory cognitive process. The Gough mode is the main human reading model that enables the authors to acquire deep semantics in a text reading process. Generalized semantic field is proposed to store the domain knowledge in the form of Long Term Memory (LTM). Specialized semantic field, which is acquired by the interaction process between the text fragment and the domain knowledge, is introduced to describe the change process of textual semantics. By their mutual actions, the authors can get the deep textual semantics which enhances the capability of text understanding; therefore, the machine can understand the text more precisely and correctly than those models only obtaining surface textual semantics.


2011 ◽  
Vol 10 (05) ◽  
pp. 913-931 ◽  
Author(s):  
XIANYONG FANG ◽  
CHRISTIAN JACQUEMIN ◽  
FRÉDÉRIC VERNIER

Since the results from Semantic Web search engines are highly structured XML documents, they cannot be efficiently visualized with traditional explorers. Therefore, the Semantic Web calls for a new generation of search query visualizers that can rely on document metadata. This paper introduces such a visualization system called WebContent Visualizer that is used to display and browse search engine results. The visualization is organized into three levels: (1) Carousels contain documents with the same ranking, (2) carousels are piled into stacks, one for each date, and (3) these stacks are organized along a meta-carousel to display the results for several dates. Carousel stacks are piles of local carousels with increasing radii to visualize the ranks of classes. For document comparison, colored links connect documents between neighboring classes on the basis of shared entities. Based on these techniques, the interface is made of three collaborative components: an inspector window, a visualization panel, and a detailed dialog component. With this architecture, the system is intended to offer an efficient way to explore the results returned by Semantic Web search engines.


2018 ◽  
Vol 7 (3.3) ◽  
pp. 90
Author(s):  
Sumathi Rani Manukonda ◽  
Asst.Prof Kmit ◽  
Narayanguda . ◽  
Hyderabad . ◽  
Nomula Divya ◽  
...  

Clustering the document in data mining is one of the traditional approach in which the same documents that are more relevant are grouped together. Document clustering take part in achieving accuracy that retrieve information for systems that identifies the nearest neighbors of the document. Day to day the massive quantity of data is being generated and it is clustered. According to particular sequence to improve the cluster qualityeven though different clustering methods have been introduced, still many challenges exist for the improvement of document clustering. For web search purposea document in group is efficiently arranged for the result retrieval.The users accordingly search query in an organized way. Hierarchical clustering is attained by document clustering.To the greatest algorithms for groupingdo not concentrate on the semantic approach, hence resulting to the unsatisfactory output clustering. The involuntary approach of organizing documents of web like Google, Yahoo is often considered as a reference. A distinct method to identify the existing group of similar things in the previously organized documents and retrieves effective document classifier for new documents. In this paper the main concentration is on hierarchical clustering and k-means algorithms, hence prove that k-means and its variant are efficient than hierarchical clustering along with this by implementing greedy fast k-means algorithm (GFA) for cluster document in efficient way is considered.  


2015 ◽  
Vol 35 (6) ◽  
pp. 681-685 ◽  
Author(s):  
Maximilian Gahr ◽  
Zeljko Uzelac ◽  
René Zeiss ◽  
Bernhard J. Connemann ◽  
Dirk Lang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document