Exploratory Search Prompt Generation using n-Degree Connection in Knowledge Graph
Sudhanshu Gupta, Krishna Kumar Tiwari
Asian Journal of Research in Computer Science · pp. 318–326 · Published 9 Dec 2023
10.9734/ajrcos/2023/v16i4393Abstract
Search engines play a vital role in retrieving in- formation, but users often struggle to express their precise information needs, resulting in less-than-optimal search results. Therefore, enhancing search query refinement is crucial to elevate the accuracy and relevance of search outcomes. One particular challenge that existing search engines face is presenting refined results for queries containing two or more unrelated entities. This paper presents a novel approach for efficient search prompt generation by leveraging connected nodes and attributes in the knowledge graph. We propose a comprehensive exploration technique that explores the n-degrees connections and their at- tributes to generate all possible imaginative prompts. We realized that n-degrees connection exploration is an expensive task, hence we conducted experiments to determine the effectiveness of 2- degree exploration prompts in covering all the user-asked queries within the provided dataset. In testing with approximately 2000 queries on a related knowl- edge graph dataset, we found out that our proposed methodol- ogy significantly improved query coverage. At n=1 depth, the coverage increased from 58% without the methodology to 84% with it. At n=2 depth, the coverage rose from 92% without the methodology to nearly 99% with it. Additionally, due to our question caching strategy at n=2, we observed faster response times for all questions.
References (14)
- 1 A Survey on Knowledge Graphs: Representation, Acquisition, and Applications [DOI]
- 2 Knowledge Graph Embedding: A Survey of Approaches and Applications [DOI]
- 3 A Review of Relational Machine Learning for Knowledge Graphs [DOI]
- 4 Learning Structured Embeddings of Knowledge Bases [DOI]
- 5 gStore: a graph-based SPARQL query engine [DOI]
- 6 Natural Language Questions for the Web of Data
- 7 Evaluating question answering over linked data [DOI]
- 8 Multilingual Question Answering over Linked Data (QALD-3): Lab Overview [DOI]
- 9 Fast top-k search in knowledge graphs [DOI]
- 10 Effective Searching of RDF Knowledge Graphs [DOI]
- 11 Querying Web-Scale Information Networks Through Bounding Matching Scores [DOI]
- 12 Proceedings of the 2008 ACM SIGMOD international conference on Management of data
- 13 Proceedings of the 12th international conference on World Wide Web
- 14 2016 IEEE 32nd International Conference on Data Engineering (ICDE) [DOI]
Cited by 0
No indexed citations yet.
Related research
- Reptiles as Experimental Models: Uncovering Their Role in Drug Development and Health Research — shares topic coverage
- Search Query Refinement Using Context, Knowledge and Long-term Memorization — shares topic coverage
- Reprofiling Hydrogen Peroxide from Antiseptics to Pyolytics: A Narrative Overview of the History of Inventions in Russia — shares topic coverage
- Cost-effective Digital Prescription using Pharmaceutical Knowledge Graph — shares topic coverage
- Research and Applications of Knowledge Graphs in the Power Sector: A Review — shares topic coverage
Article metrics
Real usage data collected on this platform.
20
Page views
0
PDF downloads
3
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.