• Nenhum resultado encontrado

AN ONTOLOGY-BASED INTELLIGENT INFORMATION RETRIEVAL METHOD FOR DOCUMENT RETRIEVAL

N/A
N/A
Protected

Academic year: 2017

Share "AN ONTOLOGY-BASED INTELLIGENT INFORMATION RETRIEVAL METHOD FOR DOCUMENT RETRIEVAL"

Copied!
5
0
0

Texto

(1)

AN ONTOLOGY-BASED INTELLIGENT

INFORMATION RETRIEVAL METHOD

FOR DOCUMENT RETRIEVAL

POONAM YADAV

Research Scholar, Computer Science & Engg., NIMS University Rajasthan

Shobha Nagar, Delhi-Highway Jaipur – 303121, India poonam.ir@gmail.com

R.P. SINGH

Professor

Bimla Devi Educational Society’s Group of Institutions, JB Knowledge Park, Faridabad – 121001,

Haryana, India ravindra10765@gmail.com.

Abstract:

The document retrieval is one of the fast growing and complex research area in the field of information retrieval. In this paper, we proposed an ontology-based method for document retrieval. The ontology defined in our proposed approach gives extra freedom to choose between the documents and thus give an accurate retrieval of the documents. The results and analysis of our proposed method showed expected results and a comparative analysis was subjected for analyzing the proposed method with an existing algorithm. The F-measure comparison showed the performance improvement of the proposed method with respect to the existing method.

Keywords: Information retrieval, Document retrieval, Ontology, mutual association, array index, recall, precision, f-measure.

1. Introduction

In the area of searching, text and documents document retrieval plays a key role. It is very hard to obtain a specific content from the internet database, so for the ease of that process searching is taken in concern. In order to fetch the whole document, the document retrieval methods are used. Document Retrieval is the computerized process of trading a list of documents that are appropriate to an inquirer’s request by associating the user’s request to spontaneously produced index of the textual content of documents in the system. Document Retrieval schemes are grounded on diverse theoretical models, which fix how matching and ranking are steered [1]. The paper is organized mainly into the following sections; the 2nd section describes the algorithm, which give way to our proposed method and also consists of the detailed description of proposed method. The 3rd section described the result evaluation and the comparative analysis of the proposed method. We conclude the proposed method with the 4th section.

2. Proposed Ontology-Based Augmented Approach for Document Retrieval

Document retrieval is one of the most demanding areas in the field of information retrieval. There are a number of algorithms for carrying out the document retrieval process. Here, in this paper we have proposed a document retrieval technique, which is an ontology based technique. The processes can be explained though a block diagram that is shown Figure 1.

The ontology-based system provided quick access to documents and information with the help of taxonomy created from the concepts, which is called a concept map. So, from the concept map, we can easily form the document retrieval system. Here, we proposed a document retrieval system incorporating ontology with array indexing.

(2)

ensures the redundancy of concepts or documents in the database. Our method is mainly based on four steps, 1) Concept Extraction, 2) Ontology Definition, 3) Indexing, and 4) Retrieval. Prior to these four steps, there are some preprocessing step, which includes the most common document formatting methods like stop word

removal and the stemming.

After the preprocessing, the document is subjected to concept extraction phase, which extracts the most frequent concepts from the documents. The third phase is defined as Indexing, which is pointed on giving index to each of the documents and the indexing is named as array indexing. The fourth and the final step constitute the retrieval of the documents, the retrieval is based on ontology definition and the array index of each documents.

3. Results and Discussion

The experimental results of the proposed method to document retrieval are presented in this section. The proposed method has been implemented in java (jdk 1.6) and the experimentation is performed on a 3.0 GHz Core 2duo PC machine with 2 GB main memory. The evaluation of our proposed method is executed by evaluating three databases; each database is having 1000 documents which are different in their content.

3.1 Dataset description

We have selected three datasets for evaluating the proposed method under different criteria. The datasets are from different knowledge domains namely, Data mining, Software engineering and mobile communication. We used a web crawler algorithm for retrieving the documents from the web. The algorithm is designed in such a way that it only grabs the document which is related to the user’s search criteria. Thus the web crawler acquired 100 documents for each of the datasets. Each of the dataset containing 100 documents and each of these 100 documents are different in their contents.

3.2 Evaluation metrics

The proposed method is ontology based adaptive document retrieval, which consists of four phases including concept Extraction, ontology Definition, Indexing and retrieval. The Documents in the database are subjected to undergo these phases and obtained the results according to the algorithm defined in our proposed method. The result from our proposed method is evaluated to find the effectiveness of the proposed method. The evaluation is based on mainly three parameters, 1) Recall, 2) Precision and 3) F-measure. Based on these evaluating factors,

(3)

|

|

|

|

Re

Re Re l retrieved l doc

Doc

Doc

Doc

call

l

Doc

Re and

Doc

Retrieved are representing the total number of relevant documents and the total number of

retrieved documents in the problem space. The Recall parameter for the documents is calculated using the above represented formulae. In the similar manner, we can obtain the precision parameter of the documents with help of the following condition.

|

|

|

|

Pr

Re Re tieved retrieved l doc

Doc

Doc

Doc

ecision

The precision values and the recall values are considered for finding the F-measure value for the total dataset. Thus the F-measure can be expressed as,

doc doc doc doc

ecision

call

ecision

call

measure

F

Pr

Re

Pr

Re

.

2

3.3 Performance Evaluation

The performance of the proposed method is subjected to action on the selected three datasets. The performance evaluation graphs are plotted on the basis of the three evaluation factors such as

Re

call

doc,

Pr

ecision

doc

and

F

measure

. After evaluating all the datasets with our proposed method, we compare our method with an existing method [21] for assessing the performance of our methods. The figure 2, 3 and 4 describe the Recall, Precision and F-measure evaluations of different databases through our proposed method. Here, we represent the document related with Data mining as dataset1, Software engineering as dataset2 and mobile communication as Dataset3. Thus, we find the recall parameter for the three set of documents for the three datasets, which are in concern. The Values are mapped in the graph Fig.2. In the similar way, we plot the precision parameter also, which plotted in the graph Fig.3. After evaluating the values of recall values and the precision values, we measure the measure value for the three set of documents that we select from the three datasets. The F-measure chat is plotted in Fig. 4.

(4)

The evaluation results showed that our result provides encouraging results. Now, we compare our method with an existing method [21] using the values obtained by the existing method. From the values, we find that our proposed method, ontDR, shows advantage over the existing method, bioDR. From the evaluations and assessments, we find that our method outperformed the other methods.

Table 1. Comparison mapping Dataset bioDR

recall

bioDR precision

bioDR F-measure

OntDR recall

OntDR precision

OntDR F-measure

1 0.60 0.65 0.624 0.76 0.702 0.72985

2 0.77 0.63 0.647 0.768 0.713 0.739479

3 0.61 0.54 0.709 0.803 0.743 0.771836

Fig. 3. Precision values of different databases

(5)

4. Conclusion

We have proposed ontology based augmented method for the accurate and precise selection of the relevant information. The proposed method performed well under different test criteria and showed expected results. The key parts in the method are the mutual association value and the array index values. We have tested the proposed method with three datasets and the results obtained were up to the marks. The future enhancements to the system can be done by improving the calculation strategy of the mutual association value and by creating more dynamic array indices. From the results and comparative analysis, it is proved that the proposed method performs well under different test criteria.

References

[1] R. Meersman and Z. Tari, “Ontology Learning for Search Applications”, International transactions from Springer, pp. 1050-1062, 2007.

[2] Jan Paralic and Ivan Kostial, “Ontology-based Information Retrieval”, Information and Intelligent System, Croatia, pp. 23-28, 2003. [3] Eelco Mossel, “Crosslingual Ontology-Based Document Retrieval”, In Proceedings of the RANLP 2007 workshop of Natural

Language Processing and Knowledge Representation for eLearning Environments, Borovets, Bulgaria, 2007.

[4] D. Vallet, M. Fernández and P. Castells. “An Ontology Based Information Retrieval Model.” In Proceedings of the 2nd European Semantic Web Conference on the Semantic Web Research and Applications, pp. 455-470, 2005.

[5] L. Lemnitzer, P. Monachesi, K. Simov, A. Killing, D. Evans and C. Vertan. “Improving the search for learning objects with keywords and ontologies” In Proceedings of the Second European Conference on Technology Enhanced Learning, Crete, Greece, 2007. [6] Pablo Castells, Miriam Fernández, David Vallet, Phivos Mylonas and Yannis Avrithis, “Self-Tuning Personalized Information

Retrieval in an Ontology-Based Framework”, In Proceedings of the International Workshop on Web Semantics, pp. 977-986, 2005. [7] Xing Jiang and Ah-Hwee Tan, “OntoSearch: A Full-Text Search Engine for the Semantic Web”, In Proceedings of the 21st National

Conference on Artificial Intelligence, 2006.

[8] Khan L, McLeod D, and Hovy E, “Retrieval effectiveness of an ontology-based model for information selection”, The VLDB Journal, pp. 71–85, 2004.

[9] Contreras J, Benjamins V R, Bl´azquez M, Losada S, Salla R, Sevilla J, Navarro D, Casillas J, Mompo A, Paton D, Corcho O, Tena P, and Martos I, “A semantic portal for the International Affairs sector”, In EKAW Springer, Berlin, pp. 203–215, 2004.

[10] Shao Fen Liang, Paul Smart, Alistair Russell and Nigel Shadbolt, “Using Windmill Expansion for Document Retrieval”, The Open Information Systems Journal, Vol.3, pp.1-8, 2009.

[11] Dolf Trieschnigg, Piotr Pezik, Vivian Lee, Franciska de Jong, Wessel Kraaij and Dietrich Rebholz-Schuhmann , “MeSH Up: Effective MeSH Text Classification for Improved Document Retrieval”, Bioinformatics, vol. 25, no.11, pp. 1412-1418, 2009.

[12] Rong Zhao and Grosky W.I, “ Narrowing the semantic gap - improved text-based web document retrieval using visual features”, IEEE Transactions on Multimedia, Vol. 4 , No.2, pp. 189 – 200, 2002.

[13] Annekathrin Bartsch, Boyke Bunk, Isam Haddad, Johannes Klein, Richard Münch, Thorsten Johl , Uwe Kärst, Lothar Jänsch, Dieter Jahn and Ida Retter, “Gene-Reporter—sequence-based document retrieval and annotation”, Bioinformatics, 2009.

[14] A. S. Siva Sathya and B. Philomina Simon, “A Document Retrieval System with Combination Terms Using Genetic Algorithm”, IJCEE,Vol.2 ,No.1, pp.1-6, 2010.

[15] Jayapal R and J.K.Mendiratt, “Document Image Retrieval: An Overview”, International Journal of Computer Applications, Vol. 1, No.7, pp.114–119, 2010.

[16] V.A. Narayana, P. Premchand and A. Govardhan, "Effective Detection of Near Duplicate Web Documents in Web Crawling”, International Journal of Computational Intelligence Research, Vol. 5, No. 1, pp.83–96, 2009.

[17] Anton Karl Ingason, Sigrun Helgadottir, Hrafn Loftsson and Eirikur Rognvaldsson, "A Mixed Method Lemmatization Algorithm Using a Hierarchy of Linguistic Identities (HOLI)", Advances in Natural Language Processing-Lecture Notes in Computer Science, Vol. 5221, pp. 205-216, 2008.

[18] Lovins, J.B. “Development of a stemming algorithm”. Mechanical Translation and Computational Linguistics, Vol. 11, pp. 22-31, 1968.

[19] Raymond Y.K. Lau, Dawei Song, Yuefeng Li, Terence C.H. Cheung, and Jin-Xing Hao, “Toward a Fuzzy Domain Ontology Extraction Method for Adaptive e-Learning”, IEEE Transactions On Knowledge And Data Engineering, Vol. 21, No. 6, pp. 800-813, 2009

[20] Christos Faloutsos and Douglas W. Oard, “A survey of information retrieval and filtering methods”, Technical Report on A survey of information retrieval and filtering methods, pp. 1-24, 1995.

Imagem

Fig. 2. Recall values of different databases
Table 1. Comparison mapping

Referências

Documentos relacionados

Um modelo para recuperação e busca de informação baseado em ontologia e no círculo hermenêutico (an information seeking and retrieval model based on ontology

Ontology works better with the combination of image features [12].this paper presents a new framework for web image retrieval search engine which relay not only on ontology

place name tags using a gazetteer service, and finally formalize an ontology of place using these place names and their spatial relationships retrieved from the gazetteer service..

This article presented possible approaches to the use of a reference ontology for digital scientific journals to enhance information retrieval, supporting the development of

Using relation based search engine select the domain for information retrieval. As per our example

have proposed the document clustering, which was based on fuzzy equivalence relation that helps for information retrieval in the terms of time and relevant information.. Their

The field has grown considerably from simple keyword based search to semantically enhanced ontology driven information retrieval systems.. In its most common form a set of keywords

Empirical studies of finding similarity of R&G data set using existing Resnik, lin and J& C semantic similarity methods with the proposed information content metric is to