CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Novel Approach for Document Retrieval System with User Preferences

by Sandeep Kaur, Nidhi Bhatla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 102 - Number 9
Year of Publication: 2014
Authors: Sandeep Kaur, Nidhi Bhatla
10.5120/17845-8789

Sandeep Kaur, Nidhi Bhatla . A Novel Approach for Document Retrieval System with User Preferences. International Journal of Computer Applications. 102, 9 ( September 2014), 27-30. DOI=10.5120/17845-8789

@article{ 10.5120/17845-8789,
author = { Sandeep Kaur, Nidhi Bhatla },
title = { A Novel Approach for Document Retrieval System with User Preferences },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 102 },
number = { 9 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 27-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume102/number9/17845-8789/ },
doi = { 10.5120/17845-8789 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:32:41.512459+05:30
%A Sandeep Kaur
%A Nidhi Bhatla
%T A Novel Approach for Document Retrieval System with User Preferences
%J International Journal of Computer Applications
%@ 0975-8887
%V 102
%N 9
%P 27-30
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposes a method for Document Retrieval Systems. The document retrieval system finds information to given criteria by matching text record (documents) against user queries. The results generated from information retrieval system must have user preferences. Each user has its own perspectives and cultural context of each word or when the user is searching for highly specific, focussed topic. The probabilistic ranking based on graphic Bayesian statistics is associated with a Kuhn munkres algorithm for it to be really successful to group similar documents. The probabilistic ranking based Kuhn munkres algorithm uses the graphical model such as Bayesian statistics with Bayesian's theorem to find the probability of documents for more relevant results.

References
  1. Timotej Betina, Ivan Polasek. Document Creation with Information Retrieval System Support. 14th International Symposium on Computational Intelligence and informatics. 19-21 November, 2013. Budapest, Hungary.
  2. Liangcai Gao, Zhi Tang, Xiaoyan Lin, Yongtao Wang. A Graph-based Method of Newspaper Article Construction. 21st international conference on Pattern Recognition (ICPR 2012) November 11-15, 2012. Tsukuba, Japan.
  3. J. M. Bernardo. Bayesian Statistics Departamento de Estadística, Facultad de Matemáticas, 46100–Burjassot, Valencia, Spain.
  4. Anjewierden, A. AIDAS: Incremental Logical Structure Discovery in PDF Documents. In conference Sixth International Conference on Document Analysis and Recognition. 10-13 Sep. 2001, pp. 374-378. ISBN: 0-7695-1263-1.
  5. Stoffel, A. , Spretke, D. , Enhancing Document Structure Analysis using Visual Analytics. In Proceedings of the 2010 ACM Symposium on Applied Computing. SAC '10, 22-26 March 2010, pp. 8-12. ISBN: 978-1-60558-639-7.
  6. Kaszkiel, M. , Zobel, J. Effective ranking with arbitrary passages. In Journal of the American Society for Information Science and Technology. Feb. 2001, Vol. 52, Issue 4. Doi:10. 1002/1532-2890
  7. Hearst, M. A. TextTiling: Segmenting text into multi-paragraph subtopic passages. In Journal Computational Linguistics. March 1997, vol. 23, issue 1. Dostupné na internete: http://dl. acm. org/citation. cfm?id=972687
  8. Wan, X. Beyond topical similarity: a structural similarity measure for retrieving highly similar documents. In KNOWLEDGE AND INFORMATION SYSTEMS 2008, vol. 15, NUM. 1, pp. 55-73, DOI: 10. 1007/s10115-006-0047-1
  9. Wilkinson, R. Effective retrieval of structured documents. In Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval SIGIR '94, 1994. ISBN:0-387-19889-X
  10. Marti A. Hearst. TextTiling
  11. : Segmenting Text into Multi-paragraph Subtopic passages. Computational linguistics Volume 23 Issue 1, March 1997H. W. Kuhn, On the origin of the Hungarian Method, History of mathematical programming
  12. H. W. Kuhn, On the origin of the Hungarian Method, History of mathematical programming collection of personal reminiscences (J. K. Lenstra, A. H. G. Rinnooy Kan, and A. Schrijv Eds. ), North Holland, Amsterdam, 1991, pp. 77–81.
  13. Thomas, M. B. High Performance Document Layout Analysis. In Proc. Of SDIUT'03, 2003.
  14. Chen, M. , Ding, X. and Liang, J. Analysis, Un-derstanding and Representation of Chinese Newspaperwith Complex Layout. In Proc. of CIP'00, 2000.
  15. Aiello, M. and Pegoretti, A. Textual Article Clustering in Newspaper Pages. Applied Artificial Intelligence, 2006.
  16. Aiello, M. , Monz, C. , Todoran. L. and Worring, M. Document Understanding for a Broad Class of Documents. International Journal on Document Analysis.
Index Terms

Computer Science
Information Sciences

Keywords

IR Bayesian Statistics Bayesian Probability Graphical models Relevancy

Powered by PhDFocusTM