arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.3410cs.AI
收藏

基于描述复杂度的模糊集距离

Descriptive-complexity based distance for fuzzy sets

University of Miskolc(米什科尔茨大学);Ariel University Center of Samaria(撒马利亚阿里埃勒大学中心)

Laszlo Kovacs, Joel Ratsaby

摘要:

引入了模糊集A和B的新距离函数dist(A,B)。它基于描述的复杂性,即,描述两个集合的对称差中的元素所需的位数(平均)。距离给出了描述两个集合中的任何一个所需的额外信息量。我们证明了它的数学性质,并根据这个距离对数据进行模式聚类。

英文摘要:

A new distance function dist(A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The distance gives the amount of additional information needed to describe any one of the two sets given the other. We prove its mathematical properties and perform pattern clustering on data based on this distance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑