• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hong Min, Jia Caiyan, Li Yafang, Yu Jian. Sample-Weighted Multi-View Clustering[J]. Journal of Computer Research and Development, 2019, 56(8): 1677-1685. DOI: 10.7544/issn1000-1239.2019.20190150
Citation: Hong Min, Jia Caiyan, Li Yafang, Yu Jian. Sample-Weighted Multi-View Clustering[J]. Journal of Computer Research and Development, 2019, 56(8): 1677-1685. DOI: 10.7544/issn1000-1239.2019.20190150

Sample-Weighted Multi-View Clustering

More Information
  • Published Date: July 31, 2019
  • In the era of big data, the ability of humans to collect, store, transmit and manage data has been increasingly improved. Various industries have accumulated a large amount of data resources, which are often multi-source and heterogeneous. How to effectively cluster these multi-source data (also known as multi-view clustering) has become one of the focuses of today’s machine learning research. The existing multi-view clustering algorithms mainly pay attention to the contribution of different views and features to the cluster structure from the “global” perspective, without considering the “local” information complementary differences between different samples. Therefore, this paper proposes a new sample-weighted multi-view clustering (SWMVC). The method weights each sample with different views and adopts alternating direction method of multipliers (ADMM) to learn sample weight, which can not only learn the “local” difference of weights among multiple views in different sample points, but also reflect the “global” difference of the contribution of different views to the cluster structure, and has better flexibility. Experiments on multiple datasets show that the SWMVC method has a better clustering effect on heterogeneous view data.
  • Related Articles

    [1]Liu Runtao, Liang Jianchuang. Reverse Nearest Neighbor Query Based on New Index Structure[J]. Journal of Computer Research and Development, 2020, 57(6): 1335-1346. DOI: 10.7544/issn1000-1239.2020.20190470
    [2]Zhang Liping, Liu Lei, Hao Xiaohong, Li Song, Hao Zhongxiao. Voronoi-Based Group Reverse k Nearest Neighbor Query in Obstructed Space[J]. Journal of Computer Research and Development, 2017, 54(4): 861-871. DOI: 10.7544/issn1000-1239.2017.20151111
    [3]Zhu Huaijie, Wang Jiaying, Wang Bin, and Yang Xiaochun. Location Privacy Preserving Obstructed Nearest Neighbor Queries[J]. Journal of Computer Research and Development, 2014, 51(1): 115-125.
    [4]Yang Zexue, Hao Zhongxiao. Group Obstacle Nearest Neighbor Query in Spatial Database[J]. Journal of Computer Research and Development, 2013, 50(11): 2455-2462.
    [5]Liu Runtao, Hao Zhongxiao. Fast Algorithm of Nearest Neighbor Query for Line Segments of Spatial Database[J]. Journal of Computer Research and Development, 2011, 48(12): 2379-2384.
    [6]Zhang Xu, He Xiangnan, Jin Cheqing, and Zhou Aoying. Processing k-Nearest Neighbors Query over Uncertain Graphs[J]. Journal of Computer Research and Development, 2011, 48(10): 1871-1878.
    [7]Liao Haojun, Han Jizhong, Fang Jinyun. All-Nearest-Neighbor Queries Processing in Spatial Databases[J]. Journal of Computer Research and Development, 2011, 48(1): 86-93.
    [8]Sun Dongpu, Hao Zhongxiao. Group Nearest Neighbor Queries Based on Voronoi Diagrams[J]. Journal of Computer Research and Development, 2010, 47(7): 1244-1251.
    [9]Sun Dongpu, Hao Zhongxiao. Multi-Type Nearest Neighbor Queries with Partial Range Constrained[J]. Journal of Computer Research and Development, 2009, 46(6): 1036-1042.
    [10]Hao Zhongxiao, Wang Yudong, He Yunbin. Line Segment Nearest Neighbor Query of Spatial Database[J]. Journal of Computer Research and Development, 2008, 45(9): 1539-1545.

Catalog

    Article views (1853) PDF downloads (841) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return