The “Search from General to Particular” (SGP) Problem in Document Databases

Authors

  • Cosmina Ioana BONDOR Department of Medical Informatics and Biostatistics, University of Medicine & Pharmacy, Cluj-Napoca, Romania.

Keywords:

Text mining, Document databases, Knowledge discovery, Information retrieval.

Abstract

The amount of information stored in databases doubled at every 20 months. There is important knowledge stored in text databases. The aim of these article was to solve the problem of “searching from general to particular” (SGP) in document databases. As a result of the research we gave the “two level” algorithm and we illustrate this algorithm on an example.

Published

20.04.2011

How to Cite

1.
BONDOR CI. The “Search from General to Particular” (SGP) Problem in Document Databases. Appl Med Inform [Internet]. 2011 Apr. 20 [cited 2024 Dec. 27];21(3, 4):60-4. Available from: https://ami.info.umfcluj.ro/index.php/AMI/article/view/130

Issue

Vol. 21 No. 3, 4 (2007)

Section

Articles

License

 Creative Commons License
All papers published in Applied Medical Informatics are licensed under a Creative Commons Attribution (CC BY 4.0) International License.