Curvature Regularized Similarity Based Ricci Flow Embedding

被引:0
作者
Behera, Adarsh Prasad [1 ]
Rani, Puja [1 ]
Verma, Shekhar [1 ]
Kumar, Manish [1 ]
机构
[1] Indian Inst Informat Technol, Dept Informat Technol, Allahabad 211012, Uttar Pradesh, India
来源
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE | 2023年 / 7卷 / 01期
关键词
Manifolds; Measurement; Geometry; Kernel; Manganese; Pattern recognition; Heating systems; Classification; computation cost; embedding; error rate; non Euclidean data; pairwise similarity data; regularization; Ricci flow; sectional curvature; REPRESENTATION;
D O I
10.1109/TETCI.2022.3182752
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work proposes a novel curvature regularization method to regularize the individual sectional curvatures in Similarity-Based Ricci Flow Embedding (SBRFE) to reduce the non-Euclidean artefacts and compute the Euclidean embedding of similarity-based data sets. In pattern recognition, pairwise similarity or dissimilarity data have been used as alternative to the more conventional feature vector representation. While similarity representations are rarely Euclidean, most methods involving statistical analysis or learning of such data require them to be Euclidean. In SBRFE, each similarity is considered an individual entity, and the respective sectional curvature is calculated and updated separately. This compromises the smoothness of the manifold and causes numerical instability. To overcome this problem, we used regularized Newton's method (RNM) to regularize the sectional curvatures of each patch obtained from the initial curvature computation. It ensures numerical stability in the embedding and smoothens the manifold. It also preserves both the local and global geometry of the original data sets. Results show that proposed curvature regularized similarity-based Ricci Flow Embedding (CRRFE) is able to estimate the Euclidean embedding of similarity data sets with much lower computation cost and time complexity than the existing regularization method. Comparison results show that our proposed methodology outperforms other existing embedding methods in most data sets with a lower classification error rate.
引用
收藏
页码:150 / 163
页数:14
相关论文
共 32 条
  • [1] A set theory based similarity measure for text clustering and classification
    Amer, Ali A.
    Abdalla, Hassan I.
    [J]. JOURNAL OF BIG DATA, 2020, 7 (01)
  • [2] WSN Localization Using Similarity-Based Ricci Flow Embedding
    Behera, Adarsh Prasad
    Parhi, Elisha
    Verma, Shekhar
    Kumar, Manish
    [J]. IEEE SENSORS JOURNAL, 2021, 21 (19) : 22094 - 22103
  • [3] Bhattacharyya A., 1943, B CALCUTTA MATH SOC, V35, P99, DOI DOI 10.1038/157869B0
  • [4] Cha S.H., 2007, City, V1, P300
  • [5] Locally linear embedding: a survey
    Chen, Jing
    Liu, Yang
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2011, 36 (01) : 29 - 48
  • [6] Chow B, 2003, J DIFFER GEOM, V63, P97
  • [7] Duin RPW, 2010, LECT NOTES COMPUT SC, V6218, P324, DOI 10.1007/978-3-642-14980-1_31
  • [8] Duin RPW, 2008, LECT NOTES COMPUT SC, V5342, P551, DOI 10.1007/978-3-540-89689-0_59
  • [9] Ghojogh B., 2020, ARXIV200908136
  • [10] Han J, 2012, MOR KAUF D, P1