• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Yan Xiaoqiang, Ye Yangdong. Cross-Media Clustering by Share and Private Information Maximization[J]. Journal of Computer Research and Development, 2019, 56(7): 1370-1382. DOI: 10.7544/issn1000-1239.2019.20180470
Citation: Yan Xiaoqiang, Ye Yangdong. Cross-Media Clustering by Share and Private Information Maximization[J]. Journal of Computer Research and Development, 2019, 56(7): 1370-1382. DOI: 10.7544/issn1000-1239.2019.20180470

Cross-Media Clustering by Share and Private Information Maximization

More Information
  • Published Date: June 30, 2019
  • Recently, the rapid emergence of cross media data with typical multi-source and heterogeneous characteristic brings great challenges to the traditional data analysis approaches. However, the most of existing approaches for cross media data heavily rely on the shared latent feature space to construct the relationships between multiple modalities, while ignoring the private information hidden in each modality. Aiming at this problem, this paper proposes a novel share and private information maximization (SPIM) algorithm for cross media data clustering, which leverages the shared and private information into the clustering process. Firstly, we present two shared information construction models: 1) Hybrid words (H-words) model. In this model, the low-level features in each modality are transformed into words or visual words co-occurrence vector, then a novel agglomerative information maximization is presented to build the hybrid word space for all modalities, which ensures the statistical correlation between the low-level features of multiple modalities. 2) Clustering ensemble (CE) model. This model adopts the mutual information to measure the similarity between the clustering partitions of different modalities, which ensures the semantic correlation of the high-level clustering partitions. Secondly, SPIM algorithm integrates the shared information of multiple modalities and the private information of individual modalities into a unified objective function. Finally, the optimization of SPIM algorithm is performed by a sequential “draw-and-merge” procedure, which guarantees the function converge to a local maximum. The experimental results on 6 cross media datasets show that the proposed approach compares favorably with the existing state-of-the-art cross-media clustering methods.
  • Related Articles

    [1]Zhang Shuyi, Xi Zhengjun. Quantum Hypothesis Testing Mutual Information[J]. Journal of Computer Research and Development, 2021, 58(9): 1906-1914. DOI: 10.7544/issn1000-1239.2021.20210346
    [2]Chu Xiaokai, Fan Xinxin, Bi Jingping. Position-Aware Network Representation Learning via K-Step Mutual Information Estimation[J]. Journal of Computer Research and Development, 2021, 58(8): 1612-1623. DOI: 10.7544/issn1000-1239.2021.20210321
    [3]Li Feng, Miao Duoqian, Zhang Zhifei, Zhang Wei. Mutual Information Based Granular Feature Weighted k-Nearest Neighbors Algorithm for Multi-Label Learning[J]. Journal of Computer Research and Development, 2017, 54(5): 1024-1035. DOI: 10.7544/issn1000-1239.2017.20160351
    [4]Zhao Xingwang, Liang Jiye. An Attribute Weighted Clustering Algorithm for Mixed Data Based on Information Entropy[J]. Journal of Computer Research and Development, 2016, 53(5): 1018-1028. DOI: 10.7544/issn1000-1239.2016.20150131
    [5]Guo Jingfeng, Lü Jiaguo. Influence Maximization Based on Information Preference[J]. Journal of Computer Research and Development, 2015, 52(2): 533-541. DOI: 10.7544/issn1000-1239.2015.20131311
    [6]Lou Zhengzheng, Ye Yangdong, and Liu Ruina. Non-Redundant Multi-View Clustering Based on Information Bottleneck[J]. Journal of Computer Research and Development, 2013, 50(9): 1865-1875.
    [7]Xu Junling, Zhou Yuming, Chen Lin, Xu Baowen. An Unsupervised Feature Selection Approach Based on Mutual Information[J]. Journal of Computer Research and Development, 2012, 49(2): 372-382.
    [8]Tian Zhihong, Zhang Yongzheng, Zhang Weizhe, Li Yang, Ye Jianwei. An Adaptive Alert Correlation Method Based on Pattern Mining and Clustering Analysis[J]. Journal of Computer Research and Development, 2009, 46(8): 1304-1315.
    [9]Chen Gang and Chen Xinmeng. An Audio Feature Extraction Method Taking Class Information into Account[J]. Journal of Computer Research and Development, 2006, 43(11): 1959-1964.
    [10]Song Yuqing, Xie Conghua, Zhu Yuquan, Li Cunhua, Chen Jianmei, Wang Lijun. Research on Medical Image Clustering Based on Approximate Density Function[J]. Journal of Computer Research and Development, 2006, 43(11): 1947-1952.
  • Cited by

    Periodical cited type(3)

    1. 甘臣权,付祥,冯庆东,祝清意. 基于公共情感特征压缩与融合的轻量级图文情感分析模型. 计算机研究与发展. 2023(05): 1099-1110 . 本站查看
    2. 朱明航,柳欣,于镇宁,徐行,郑书凯. 基于双向伪标签自监督学习的跨人脸-语音匹配方法. 计算机研究与发展. 2023(11): 2638-2649 . 本站查看
    3. 柳欣,王锐,钟必能,王楠楠. 结合双流网络和双向五元组损失的跨人脸-语音匹配. 计算机研究与发展. 2022(03): 694-705 . 本站查看

    Other cited types(6)

Catalog

    Article views (863) PDF downloads (335) Cited by(9)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return