EOBAA: Enhanced Ontology Based Alignment Algorithm for Mining Frequent Patterns
Keywords:Pruning, frequent patterns, interestingness, Prepost , ontologies.
Mining frequent patterns are most widely used in many applications such as supermarkets, diagnostics, and other real-time applications. Performance of the algorithm is calculated based on the computation of the algorithm. It is very tedious to compute the frequent patterns in mining. Many algorithms and techniques are implemented and studied to generate the high-performance algorithms such as Prepost+ which employees the N-list to represent itemsets and directly discovers frequent itemsets using a set-enumeration search tree. But due to its pruning strategy, it is known that the computation time is more for processing the search space. It enumerates all item sets from datasets by the principle of exhaustion and they donâ€™t sort them based on utility, but only a statistical proof of most recurring itemset. In this paper, the proposed Enhanced Ontologies based Alignment Algorithm (EOBAA) to identify, extract, sort out the HUI's from FI's. To improve the similarity measure the proposed system adopted Cosine similarity. The experiments conducted on 1 real datasets and show the performance of the EOBAA based on the computation time and accuracy of the proposed EOBAA.
 M. Ehrig, Ontology Alignment: Bridging the Semantic Gap, Springer Science+Business Media, LLC 2007.
 J. Euzenat, A. Ferrara, C. Meilicke, A. Nikolov, J. Pane, F. Scharfffe, P. Shvaiko, H. Stuckenschmidt, O. Svab-Zamazal, V. Svatek, and C. Trojahn, â€œThe Results of the Ontology Alignment Evaluation Initiative 2010. Ontology Matching Workshop, International Semantic Web Conference, Shanghai, China 2010.
 J. Euzenat, â€œAn API for ontology alignment,â€ Proc of the 3rd International Semantic Web Conference (ISWC-2004), Hiroshima, Japan, 2004.
 N. Goodman, â€œSeven strictures on similarityâ€ In N. Goodman (Ed.), Problems and projects. Pp. 437-447. Bobbs-Merrill, New York, 1972.
 D.L. Medin, R. L. Goldstone, and D. Gentner, â€œRespects for Similarity,â€ Psychological Review 100(2), pp. 254-278, 1993.
 V. Cross and T. Sudkamp, Similarity and Compatibility in Fuzzy Set Theory: Assessment and Applications. New York: Physica-Verlag, ISBN 3-7908-1458, 2002.
 A.Doan, J. Madhavan, P. Domingos, and A. Halevy, â€œLearning to Map between Ontologies on the Semantic Web,â€ Proc. 11th Int â€˜l Conf. World Wide Web (WWW â€˜02), pp. 662-673, 2002.
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).