Kayed, A.; Hirzallah, N.; Al Shalabi, L.A.; Najjar, M.: Building ontological relationships : a new approach (2008)
0.01
0.0059357807 = product of:
0.023743123 = sum of:
0.023743123 = product of:
0.047486246 = sum of:
0.047486246 = weight(_text_:software in 2357) [ClassicSimilarity], result of:
0.047486246 = score(doc=2357,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.2629875 = fieldWeight in 2357, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.046875 = fieldNorm(doc=2357)
0.5 = coord(1/2)
0.25 = coord(1/4)
- 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.
