Building ontological relationships: A new approach Export

@article{citeulike:3270295, abstract = {Ontology plays an essential role in recognizing the meaning of the information in Web documents. It has been shown that extracting concepts is easier than building relationships among them. For a defined set of concepts, many existing algorithms produce all possible relationships for that set. This makes the process of refining the relationships almost impossible. A new algorithm is needed to reduce the number of relationships among a defined set of concepts produced by existing algorithms. This article contributes such an algorithm, which enables a domain-knowledge expert to refine the relationships linking a set of concepts. In the research reported here, text-mining tools have been used to extract concepts in the domain of e-commerce laws. A new algorithm has been proposed to reduce the number of extracted relationships. It groups the concepts according to the number of relationships with other concepts and provides formalization. An experiment and software have been built, proving that reducing the number of relationships will reduce the efforts needed from a human expert.}, address = {Department of Computer Science, Applied Science University, Amman 11931, Jordan}, author = {Kayed, Ahmad and Hirzallah, Nael and Luai and Najjar, Mohannad}, citeulike-article-id = {3270295}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/asi.20879}, citeulike-linkout-1 = {http://www3.interscience.wiley.com/cgi-bin/abstract/119881050/ABSTRACT}, doi = {10.1002/asi.20879}, journal = {Journal of the American Society for Information Science and Technology}, keywords = {algorithm, associative, ontology, semantics}, number = {11}, pages = {1801--1809}, posted-at = {2008-09-15 19:29:00}, priority = {2}, title = {Building ontological relationships: A new approach}, url = {http://dx.doi.org/10.1002/asi.20879}, volume = {59}, year = {2008} }

TY - JOUR ID - citeulike:3270295 L3 - citeulike-article-id:3270295 N2 - Ontology plays an essential role in recognizing the meaning of the information in Web documents. It has been shown that extracting concepts is easier than building relationships among them. For a defined set of concepts, many existing algorithms produce all possible relationships for that set. This makes the process of refining the relationships almost impossible. A new algorithm is needed to reduce the number of relationships among a defined set of concepts produced by existing algorithms. This article contributes such an algorithm, which enables a domain-knowledge expert to refine the relationships linking a set of concepts. In the research reported here, text-mining tools have been used to extract concepts in the domain of e-commerce laws. A new algorithm has been proposed to reduce the number of extracted relationships. It groups the concepts according to the number of relationships with other concepts and provides formalization. An experiment and software have been built, proving that reducing the number of relationships will reduce the efforts needed from a human expert. IS - 11 JF - Journal of the American Society for Information Science and Technology AD - Department of Computer Science, Applied Science University, Amman 11931, Jordan EP - 1809 TI - Building ontological relationships: A new approach VL - 59 SP - 1801 KW - algorithm KW - associative KW - ontology KW - semantics AU - Kayed, Ahmad AU - Hirzallah, Nael AU - Luai AU - Najjar, Mohannad PY - 2008/// UR - http://dx.doi.org/10.1002/asi.20879 ER -