Metric-based stochastic conceptual clustering for ontologies

被引:11
作者
Fanizzi, Nicola [1 ]
d'Amato, Claudia [1 ]
Esposito, Floriana [1 ]
机构
[1] Univ Bari, Dipartimento Informat, I-70125 Bari, Italy
关键词
Conceptual clustering; Unsupervised learning; Metric learning; Genetic programming; Evolutionary algorithms; Description logics; Randomized optimization; CONCEPT DRIFT; DL;
D O I
10.1016/j.is.2009.03.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A conceptual clustering framework is presented which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Semantic Web. The framework adopts an effective and language-independent family of semi-distance measures defined for the space of individual resources. These measures are based on a finite number of dimensions corresponding to a committee of discriminating features represented by concept descriptions. The clustering algorithm expresses the possible clusterings in terms of strings of central elements (medoids, w.r.t. the given metric) of variable length. The method performs a stochastic search in the space of possible clusterings, exploiting a technique based on genetic programming. Besides, the number of clusters is not necessarily required as a parameter: a natural number of clusters is autonomously determined, since the search spans a space of strings of different length. An experimentation with real ontologies proves the feasibility of the clustering method and its effectiveness in terms of standard validity indices. The framework is completed by a successive phase, where a newly constructed intensional definition, expressed in the adopted concept language, can be assigned to each cluster. Finally, two possible extensions are proposed. One allows the induction of hierarchies of clusters. The other applies clustering to concept drift and novelty detection in the context of ontologies. (c) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:792 / 806
页数:15
相关论文
共 39 条
[1]  
[Anonymous], 2001, Pattern Classification
[2]  
Baader F, 2003, DESCRIPTION LOGIC HANDBOOK: THEORY, IMPLEMENTATION AND APPLICATIONS, P43
[3]   Some new indexes of cluster validity [J].
Bezdek, JC ;
Pal, NR .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1998, 28 (03) :301-315
[4]  
Bloehdorn S, 2007, LECT NOTES COMPUT SC, V4825, P58
[5]  
BORGIDA A, 2005, WORK NOT INT DESCR L, V147
[6]  
d'Amato C, 2008, LECT NOTES ARTIF INT, V5268, P48, DOI 10.1007/978-3-540-87696-0_7
[7]  
d'Amato C, 2008, LECT NOTES COMPUT SC, V5021, P288
[8]  
DAMATO C, 2007, P WORKSH SERV MATH R, V243, P2007
[9]  
DAMATO C, 2006, P SEM WEB APPL PERSP, V201
[10]  
ESPOSITO F, 2004, J INTELLIGENT DATA A, V8, P133