Partial symbol ordering distance
Tipus de documentText en actes de congrés
Condicions d'accésAccés restringit per política de l'editorial
Nowadays sequences of symbols are becoming more important, as they are the standard format for representing information in a large variety of domains such as ontologies, sequential patterns or non numerical attributes in databases. Therefore, the development of new distances for this kind of data is a crucial need. Recently, many similarity functions have been proposed for managing sequences of symbols; however, such functions do not always hold the triangular inequality. This property is a mandatory requirement in many data mining algorithms like clustering or k-nearest neighbors algorithms, where the presence of a metric space is a must. In this paper, we propose a new distance for sequences of (non-repeated) symbols based on the partial distances between the positions of the common symbols. We prove that this Partial Symbol Ordering distance satisfies the triangular inequality property, and we finally describe a set of experiments supporting that the new distance outperforms the Edit distance in those ecenarios where sequence similarity is related to the positions occupied by the symbols.
CitacióHerranz, J.; Nin, J. Partial symbol ordering distance. A: International Conference on Modeling Decisions for Artificial Intelligence. "6th International Conference on Modeling Decisions for Artificial Intelligence". Awaji Isl (Japan): Springer Verlag, 2009, p. 293-302.
Versió de l'editorhttp://www.springerlink.com/content/g0w1m6v4u2851407/