Clustering Uncertain Data Objects Using Jeffreys-Divergence and Maximum Bipartite Matching Based Similarity Measure
In recent years, uncertain data clustering has become the subject of active research in many fields, for example, pattern recognition, and machine learning. Nowadays, researchers have committed themselves to substitute the traditional distance or similarity measures with new metrics in the existing...
Main Authors: | Krishna Kumar Sharma, Ayan Seal, Anis Yazidi, Ali Selamat, Ondrej Krejcar |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9440910/ |
Similar Items
-
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
by: Shibsankar Das
Published: (2020-08-01) -
Maximum Semi-Matching Problem in Bipartite Graphs
by: Katrenič Ján, et al.
Published: (2013-07-01) -
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
by: HUIZhi-hao(惠志昊), et al.
Published: (2009-09-01) -
Generalized Matching Preclusion in Bipartite Graphs
by: Zachary Wheeler, et al.
Published: (2018-01-01) -
Partitioning to three matchings of given size is NP-complete for bipartite graphs
by: Pálvölgyi Dömötör
Published: (2014-12-01)