A Survey on Taxonomy learning using Graph-based Approach
Diksha R. Kamble, Krishna S. Kadam , , ,
Affiliations Dept. of Computer Science and Engineering, DKTEâ€™s TEI, Ichalkaranji (An Autonomous Institute), 416115, India.
:10.22362/ijcert/2017/v4/i11/xxxx [UNDER PROCESS]
Taxonomy learning is an important task for developing successful applications as well as knowledge obtaining, sharing and classification. The manual construction of the domain taxonomies is a time-consuming task. To reduce the time and human effort will build a new taxonomy learning approach named as TaxoFinder. TaxoFinder takes three steps to automatically build the taxonomy. First, it identifies the concepts from a domain corpus. Second, it builds CGraphs where a node represents each of such concepts and an edge represents an association between nodes. Each edge has a weight indicating the associative strength between two nodes. Lastly TaxoFinder derives the taxonomy from the graph using analytic graph algorithm. The main aim of TaxoFinder is to develop the taxonomy in such a way that it covers the overall maximum associative strengths among the concepts in the graph to build the taxonomy. In this evaluation, compare TaxoFinder with existing subsumption method and show that TaxoFinder is an effective approach and give a better result than subsumption method.
Diksha R. Kamble and Krishna S. Kadam (2017). A Survey on Taxonomy learning using Graph-based Approach. International Journal of Computer Engineering In Research Trends, 4(11), 539-542. Retrieved from http://ijcert.org/ems/ijcert_papers/V4I1113.pdf
 M.A.Hearst, â€œAutomatic acquisition of hyponyms from large text corpora,â€ in Proc.14th Conf. Comput. Linguistics, 1992, vol. 2,pp. 539â€“545
 F.M.Suchanek, G.Ifrim, and G.Weikum, â€œCombining linguistic and statisticalanalysis to extract relations from web documents,â€in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2006, pp. 712â€“717.
 E.-A. Dietz, D. Vandic, and F. Frasincar, â€œTaxoLearn: A semantic approach to domain taxonomy learning,â€ in Proc. IEEE/WIC/ACM Int. Joint Conf. Web Intell. Intell. Agent Technol., 2012, pp. 58â€“65.
 W. Wang, P. Mamaani Barnaghi, and A. Bargiela,â€œProbabilistic topic models for learning terminological ontologies,â€ IEEE Trans.Knowl. Data Eng., vol. 22, no. 7, pp. 1028â€“1040, Jul. 2010.
 Z. Kozareva and E. Hovy, â€œA semi-supervised method to learn and construct taxonomies using the web,â€ in Proc. Conf. Empirical Methods Natural Language Process., 2010, pp. 1110â€“1118.
 P. Velardi, S. Faralli, and R. Navigli, â€œOntoLearn Reloaded: A graph-based algorithm for taxonomy induction,â€ Comput. Linguistics,vol. 39, no. 3, pp. 665â€“707, 2013.
 K. Meijer, F. Frasincar, and F. Hogenboom, â€œA semantic approachfor extracting domain taxonomies from text,â€ Decision SupportSyst., vol. 62, pp. 78â€“93, 2014.
 Y.-B. Kang, P. D. Haghighi, and F. Burstein, â€œCFinder: An Intelligent Key Concept Finder from Text for Ontology Development,â€Expert Syst. Appl., vol. 41, no. 9, pp. 4494â€“4504, 2014.
 Yong-Bin Kang, Pari Delir Haghigh, and Frada Burstein,â€TaxoFinder: A graph-based approach for taxonomy learning.â€ Vol.28, no 2,2016.
 Satish Kumar, Sujan Babu Vadde, â€ Typicality Based Content-Boosted Collaborative Filtering Recommendation Framework. â€œInternational Journal of Computer Engineering in Research Trends., vol.2, no.11, pp. 809-813, 2015.
 Y.Usha Sree,P.Ragha Vardhani.â€ Pattern Finding in Large Datasets with Big Data Analytics Mechanism. â€œInternational Journal of Computer Engineering in Research Trends., vol.2, no.5, pp. 359-364, 2015.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.