CFP last date
22 April 2024
Reseach Article

Phrase Prioritization Algorithm and Supporting Data Structure for Retrieval

by Sachin Kumar, Pratishtha Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 12
Year of Publication: 2015
Authors: Sachin Kumar, Pratishtha Gupta
10.5120/ijca2015906247

Sachin Kumar, Pratishtha Gupta . Phrase Prioritization Algorithm and Supporting Data Structure for Retrieval. International Journal of Computer Applications. 126, 12 ( September 2015), 29-35. DOI=10.5120/ijca2015906247

@article{ 10.5120/ijca2015906247,
author = { Sachin Kumar, Pratishtha Gupta },
title = { Phrase Prioritization Algorithm and Supporting Data Structure for Retrieval },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 12 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 29-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number12/22605-2015906247/ },
doi = { 10.5120/ijca2015906247 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:17.160478+05:30
%A Sachin Kumar
%A Pratishtha Gupta
%T Phrase Prioritization Algorithm and Supporting Data Structure for Retrieval
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 12
%P 29-35
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In the heart of this research work lies the proposed algorithm, which prioritizes the phrases of the search queries. This algorithm suggests the methodology of fetching phrases and then searching all possible phrases, so that recall value can be increased. The most important issue in this regard is the usage of such data structure, which facilitates the efficient search of phrases in documents. For this purpose, Linked Representation of Sparse Matrix has been suggested, which consists of linked lists not only rowwise but also columnwise. Columns correspond to the documents and hence make the search of every possible phrase efficient. Rows correspond to the dictionary of words. Linked Representation maintain the dynamic nature of documents as well as insertion and deletion of words from the documents. Emphasis has also been given to the categorization of dictionary and query words into specific and general words, which will increase the precision of search results. Specific words will be given higher priority as compared to the general words. Synonyms have also been considered for retrieval of documents, hence increasing the understanding between user requirement and search engine

References
  1. Arash S et al., 2013 "Prioritization of innovation factors by the integration of concurrent function deployment and P diagram with a case study in Sepahan Industry Group", Journal of Manufacturing Technology Management, Vol. 24 Iss: 6, pp.952 – 971
  2. Dionysios S. et al., 2006 "AML-related technologies: a systemic risk", Journal of Money Laundering Control, Vol. 9 Iss: 2, pp.157 – 172
  3. Douglas B. et al., 1997 "Beyond ethnography: Towards writerly accounts of organizing in marketing", European Journal of Marketing, Vol. 31 Iss: 3/4, pp.264 – 284
  4. Ethan S. et al., 2011, Strategic Change and the Jazz Mindset: Exploring Practices that Enhance Dynamic Capabilities for Organizational Improvisation, in Abraham B. (Rami) Shani, Richard W. Woodman, William A. Pasmore (ed.) Research in Organizational Change and Development (Research in Organizational Change and Development, Volume 19) Emerald Group Publishing Limited, pp.55 – 90
  5. Hull, D. A. et al., 1996” A Detailed Analysis of English Stemming Algorithms, Xerox Technical Report”
  6. Hull, D. A. et al.,1996 ” Stemming Algorithms – A Case Study for Detailed Evaluation”, JASIS, 47(1): 70–84
  7. Kostas S. M. et al., 2002 "GENESYS: an expert system for production scheduling", Industrial Management & Data Systems, Vol. 102 Iss: 6, pp.309 – 317
  8. Marie Boltz et al., 2010 "Building a framework for a geriatric acute care model", Leadership in Health Services, Vol. 23 Iss: 4, pp.334 – 360
  9. Ming-Lang T. et al., 2011 "Evaluating the effectiveness of e-learning system in uncertainty", Industrial Management & Data Systems, Vol. 111 Iss: 6, pp.869 – 889
  10. Mehmet S. et al., 2008 "Hybrid analytical hierarchy process model for supplier selection", Industrial Management & Data Systems, Vol. 108 Iss: 1, pp.122 - 142
  11. Marcel M. et al., 2003 "Transparency on the Net: functions and deficiencies of Internet search engines", info, Vol. 5 Iss: 1, pp.52 – 74
  12. Shawn A. W. et al., 2006, 16. Design of a Multi-Vehicle Control System: System Design and User Interaction, in Nancy J. Cooke, Heather L. Pringle, Harry K. Pedersen, Olena Connor (ed.) Human Factors of Remotely Operated Vehicles (Advances in Human Performance and Cognitive Engineering Research, Volume 7) Emerald Group Publishing Limited, pp.223 – 236
  13. Sarah H. T. et al., 2013 , All Metadata Politics Is Local: Developing Meaningful Quality Standards, in Jung-Ran Park , Lynne C. Howarth (ed.) New Directions in Information Organization (Library and Information Science, Volume 7) Emerald Group Publishing Limited, pp.229 – 250
  14. Wei-yu K. C. et al., 2010 "An analytic hierarchy process approach to assessing consumers' distribution channel preference", International Journal of Retail & Distribution Management, Vol. 38 Iss: 2, pp.78 – 96
  15. ConvertedtoXMLfrom:ftp://ftp.cs.cornell.edu/pub/smart/cran/ (for 1400 documents)
  16. ConvertedtoXMLfrom:ftp://ftp.cs.cornell.edu/pub/smart/cran/(for 50 queries)
  17. Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, Fundamentals of data structures in C++,2nd Edition ,2008, Universities Press(India) Private Limited.
  18. Christopher D. Manning(Stanford University) ,Prabhakar Raghvan(Yahoo! Research), Hinrich Schutze(University of Stuttgart),IntroductiontoInformationRetrieval,2009,Cambridge University Press.
Index Terms

Computer Science
Information Sciences

Keywords

Linked Representation Search Engine Precision Recall F-measure Algorithms Database