Proceol: Probabilistic Relational of Concept Extraction In Ontology Learning
(*) Corresponding author
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)
Ontologies play an important role in knowledge Management like annotating web resources, web mining and other internet related applications. Since the manual construction of a high quality ontologies are more expensive and take more time to complete the process. So, more number of automatic and semi-automatic ontologies is created in the system and also existing ontology learning provides the best results, but sometimes makes the failure due to process of noise in the text. Noise text is one of the major problems in the ontology learning. Because noise text are could not extracted. It makes the problem in completion of the extraction. For avoiding the noise in the data and providing the quick process, paper introduce the novel concept extraction method. This concept extraction presents an ontology building through the automatic and semi-automatic process. Most of the ontology learning technique developed using the Classifiers, NLP, probabilistic and statistical learning. For the concept extraction it uses the process of statistical learning with the combination of text. To increases the richness and avoid the issue of noise, this paper proposes the method of PROCEOL (Probabilistic Relational of Concept Extraction in Ontology Learning). An experimental result provides the best concept extractions compared to the state of the art method.
Copyright © 2014 Praise Worthy Prize - All rights reserved.
Lucas Drumond and Rosario Girardi, “A Survey of Ontology Learning Procedures,” WONTO, volume 427 of CEUR Workshop Proceedings, CEUR-WS.org, vol. 427, 2008.
Chris Biemann, “Ontology Learning from Text: A Survey of Methods,” LDV Forum, vol. 20, no.2, pp.75-93, 2005.
Paul Buitelaar, Philipp Cimiano and Bernardo Magnini, “Ontology Learning from Text: An Overview,” Ontology Learning from Text: Methods, Evaluation and Applications, IOS Press, pp. 3-12, 2005.
Cimiano P, Hotho A, Staab S, “Learning Concept Hierarchies from Text Corpora usingFormal Concept Analysis,” Journal of Artificial Intelligence Research, vol. 24, no.1, pp. 305–339, 2005.
Cimiano P, Hotho A, Staab S, “Clustering Concept Hierarchies from Text,” Proceedings of the Conference on Lexical Resources and Evaluation (LREC), pp. 1721–1724, 2004.
Lucas Drumond and Rosario Girardi, “An Experiment Using Markov Logic Networks to Extract Ontology Concepts from Text,” ACM Special Interest Group on Applied Computing, pp. 1354-1358, 2010.
Daniel Lowd and Domingos.P, ”Efficient Weight Learning for markov logic networks”, Proceedings of the Eleventh European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, pp. 200-211, 2007.
Tuyen N. Huynh and Raymond J. Mooney, ”Max-margin weight learning for Markov logic networks”, Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-09), Bled, Slovenia, pp.564-57, 2009.
Parag Singla and Pedro Domingos, “Discriminative Training of Markov Logic Networks,” Proceedings of the 20th National Conference on Artificial Intelligence, vol. 2, pp. 868-873, 2005
Rohit Kate and Ray Mooney, “Probabilistic Abduction using Markov Logic Networks”, Proceedings of the IJCAI-09 Workshop on Plan, Activity, and Intent Recognition, 2009.
Kaustubh Beedkar, Luciano Del Corro, Rainer Gemulla, “Fully Parallel Inference in Markov Logic Networks”, BTW, pp.205-224, 2013.
Hassan Khosravi, ”Fast Parameter Learning for Markov Logic Networks Using Bayes Nets”, 22nd International Conference, Dubrovnik, Croatia, pp.102-115, September 17-19, 2012.
Biba, M., Ferilli, S., and Esposito, F.,”Discriminative Structure Learning of Markov Logic Networks,” Proceedings of the 18th international conference on Inductive Logic Programming (ILP’08), Czech Republic. Springer-Verlag, pp. 59–76, 2008.
Tuyen N. Huynh and Raymond J. Mooney, “Discriminative Structure and parameter learning for Markov Logic Networks”, Proceedings of the 25th International Conference on Machine Learning (ICML), New York,USA, Finland, pp. 416-423, July 2008.
Shalini Ghosh, Natarajan Shankar, Sam Owre, “Machine Reading Using Markov Logic Networks for Collective Probabilistic Inferences”, Proceedings of ECML-CoLISD, 2011.
Thomas Hofmann, “Probabilistic Latent Semantic Analysis,” Proceedings of 15th Conference on Uncertainty in Artificial Intelligence UAI’99, Stockholm, Sweden, pp.289-296., 1999.
Emhimed Salem Alatrish, “Comparison of Ontology Editors”, eRAF Journal on Computing, vol. 4, pp. 23 – 38, 2012.
Khondoker, M. Rahamatullah, Müller, Paul, “Comparing Ontology Development Tools Based on an Online Survey”, World Congress on Engineering 2010 (WCE 2010), London, UK, March 2010.
Mark Sanderson and Bruce Croft, “Deriving concept hierarchies from text”, SIGIR '99 Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, pp. 206-213, 1999.
Maryam Hazman, Samhaa R. El-Beltagy and Ahmed Rafea, “Ontology Learning from Domain Specific Web Documents,” International Journal of Metadata, Semantics and Ontologies, vol. 4, no. 1/2, pp.24 – 33, 2009.
Zellig Sabbettai Harris, “Mathematical Structures in Language,” Interscience Publishers, p. 230, 1968.
Marti A.Hearst, “Automatic Acquisition of Hyponyms from Large Text Corpora,” COLING '92 Proceedings of the 14th conference on Computational linguistics, vol. 2, pp. 539-545, January 1992.
Karthikeyani.V. and Karthikeyan.K, “Migrate Web Documents into Web Data,” 3rd International conference on Electronics Computer Technology (ICECT), Kanyakumari, Tamil Nadu, vol. 5, pp. 249 – 253, 2011.
Karthikeyan.K and Dr.V.Karthikeyani, “Understanding text using Anaphora Resolution”, Internation conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME), Salem, Tamil Nadu, pp- 346 – 350, 2013.
Hoifung Poon and Pedro Domingos, “Sound and Efficient Inference with Probabilistic and Deterministic Dependencies,” Proceedings of the 21st National Conference on Artificial intelligence, pp. 458-463, 2006.
Matthew Richardson.A and Pedro Domingos, “Markov Logic Networks”, Machine Learning, vol. 62, no.1-2, pp.107–136, 2006
Thomas Hofmann, “Unsupervised Learning by Probabilistic Latent Semantic Analysis, Machine Learning, Kluwer Academic Publishers, vol. 42, no. 1-2, pp. 177-196, 2001.
Wong. W, Liu. W and Bennamoun. M., “Ontology Learning from Text: A Look Back and into the Future,” ACM Computing Surveys, vol. 44, no. 4, pp.30, August 2012.
Dellschaft.K, Staab.S, “On how to perform a gold standard based evaluation of ontology learning” Proceedings of ISWC-2006 International Semantic Web Conference, Athens, GA, 2006.
Nouri, Z., Nematbakhsh, M.A., Khayyambashi, M.R., Automated complementary association learning from web documents, (2009) International Review on Computers and Software (IRECOS), 4 (6), pp. 672-683.
D. N. Kanellopoulos, S. B. Kotsiantis, Semantic Web: A State of the Art Survey, (2007) International Review on Computers and Software (IRECOS), 2. (5), pp. 428 - 442.
Jabar, M.A., Khalefa, M.S., Abdullah, R.H., Abdullah, S., Meta-analysis of ontology software development process, (2014) International Review on Computers and Software (IRECOS), 9 (1), pp. 29-37.
- » —
Please send any question about this web site to firstname.lastname@example.org
Copyright © 2005-2023 Praise Worthy Prize