default search action
Caiming Zhong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Chengwu Qian, Jiangbo Qian, Chong Wang, Xulun Ye, Caiming Zhong:
A Vision Enhancement and Feature Fusion Multiscale Detection Network. Neural Process. Lett. 56(1): 19 (2024) - [j19]Chongchong Shen
, Jiangbo Qian
Dynamic Sensing and Correlation Loss Detector for Small Object Detection in Remote Sensing Images. IEEE Trans. Geosci. Remote. Sens. 62: 1-12 (2024) - [j18]Renbo Pan
Balanced Fair K-Means Clustering. IEEE Trans. Ind. Informatics 20(4): 5914-5923 (2024) - 2023
- [j17]Zehua Zhang
Line graph contrastive learning for link prediction. Pattern Recognit. 140: 109537 (2023) - 2022
- [j16]Jianping Shi, Hong Li, Caiming Zhong, Zhouyan He, Yeling Ma:
BMEFIQA: Blind Quality Assessment of Multi-Exposure Fused Images Based on Several Characteristics. Entropy 24(2): 285 (2022) - [c16]Haopeng Chen
Research on Hybrid Flow-shop Scheduling Based on INSGA-II Algorithm. RICAI 2022: 1111-1116 - [c15]Jixiang Lu, Caiming Zhong:
Density Peak Clustering Based Split-and-Merge. IJCRS 2022: 191-202 - [i1]Zehua Zhang, Shilin Sun, Guixiang Ma, Caiming Zhong:
Line Graph Contrastive Learning for Link Prediction. CoRR abs/2210.13795 (2022) - 2021
- [j15]Chengyang Wang
Adaptive Feature Pyramid Networks for Object Detection. IEEE Access 9: 107024-107032 (2021) - [j14]Zhouyan He, Yang Song, Caiming Zhong, Li Li:
Curvature and Entropy Statistics-Based Blind Multi-Exposure Fusion Image Quality Assessment. Symmetry 13(8): 1446 (2021) - 2020
- [c14]Wei Liu, Xiaodong Yue, Caiming Zhong, Jie Zhou:
Clustering Ensemble Selection with Analytic Hierarchy Process. ICONIP (4) 2020: 41-49
2010 – 2019
- 2019
- [j13]Lianyu Hu
An Internal Validity Index Based on Density-Involved Distance. IEEE Access 7: 40038-40051 (2019) - [j12]Ting Luo, Gangyi Jiang, Mei Yu, Caiming Zhong
Convolutional neural networks-based stereo image reversible data hiding method. J. Vis. Commun. Image Represent. 61: 61-73 (2019) - [j11]Caiming Zhong
Ensemble clustering based on evidence extracted from the co-association matrix. Pattern Recognit. 92: 93-106 (2019) - [c13]Wei Liu, Xiaodong Yue, Caiming Zhong, Jie Zhou:
Clustering Ensemble Selection with Determinantal Point Processes. ICONIP (3) 2019: 621-633 - 2018
- [j10]Caiming Zhong
Cluster Ensemble Based on Iteratively Refined Co-Association Matrix. IEEE Access 6: 69210-69223 (2018) - 2016
- [c12]Wei Huang, Xiaodong Yue, Caiming Zhong, Nan Zhang:
Rough Neighborhood Covering Reduction for robust classification. ICPR 2016: 3308-3313 - [c11]Pasi Fränti, Radu Mariescu-Istodor, Caiming Zhong:
XNN Graph. S+SSPR 2016: 207-217 - 2015
- [j9]Caiming Zhong, Mikko I. Malinen, Duoqian Miao, Pasi Fränti:
A fast minimum spanning tree algorithm based on K-means. Inf. Sci. 295: 1-17 (2015) - [j8]Caiming Zhong
A clustering ensemble: Two-level-refined co-association matrix with path-based transformation. Pattern Recognit. 48(8): 2699-2709 (2015) - [j7]Caiming Zhong
Visual hierarchical cluster structure: A refined co-association matrix based visual assessment of cluster tendency. Pattern Recognit. Lett. 59: 48-55 (2015) - [c10]Zehua Zhang, Nan Zhang, Caiming Zhong, Litian Duan:
Detecting Overlapping Communities with Triangle-Based Rough Local Expansion Method. RSKT 2015: 446-456 - 2013
- [j6]Hongyun Zhang, Witold Pedrycz, Duoqian Miao, Caiming Zhong:
A global structure-based algorithm for detecting the principal graph from complex data. Pattern Recognit. 46(6): 1638-1647 (2013) - [c9]Caiming Zhong, Mikko I. Malinen, Duoqian Miao, Pasi Fränti:
Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means. CAIP (1) 2013: 262-269 - [c8]Xiaodong Yue, Duoqian Miao, Yue Wu, Caiming Zhong, Yufei Chen:
Scale selection in roughness based color quantization. GrC 2013: 412-417 - 2012
- [c7]Yujun Lin, Ting Luo, Sheng Yao, Kaikai Mo, Tingting Xu, Caiming Zhong:
An improved clustering method based on k-means. FSKD 2012: 734-737 - 2011
- [j5]Hongyun Zhang, Duoqian Miao, Caiming Zhong:
Modified Principal Curves Based Fingerprint Minutiae Extraction and Pseudo Minutiae Detection. Int. J. Pattern Recognit. Artif. Intell. 25(8): 1243-1260 (2011) - [j4]Caiming Zhong, Duoqian Miao, Pasi Fränti:
Minimum spanning tree based split-and-merge: A hierarchical clustering method. Inf. Sci. 181(16): 3397-3410 (2011) - [c6]Chen Ye, Caiming Zhong:
An improved cohesion self-merging clustering algorithm. FSKD 2011: 1095-1098 - [c5]Ting Luo, Caiming Zhong, Xinyang Ying, Jianjie Fu:
Detecting community structure based on edge betweenness. FSKD 2011: 1133-1136 - 2010
- [j3]Caiming Zhong, Duoqian Miao, Ruizhi Wang:
A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognit. 43(3): 752-766 (2010) - [c4]Ting Luo, Caiming Zhong, Hong Li, Xia Sun:
A multi-prototype clustering algorithm based on minimum spanning tree. FSKD 2010: 1602-1607 - [c3]Ting Luo, Caiming Zhong:
A Neighborhood Density Estimation Clustering Algorithm Based on Minimum Spanning Tree. RSKT 2010: 557-565
2000 – 2009
- 2009
- [j2]Caiming Zhong, Duoqian Miao:
A comment on "Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding". Pattern Recognit. 42(5): 1012-1013 (2009) - [c2]Caiming Zhong, Xueming Lin, Ming Zhang:
A Local Outlier Detection Approach Based on Graph-Cut. CSO (1) 2009: 714-718 - 2008
- [j1]Caiming Zhong, Duoqian Miao, Ruizhi Wang, Xinmin Zhou:
DIVFRP: An automatic divisive hierarchical clustering method based on the furthest reference points. Pattern Recognit. Lett. 29(16): 2067-2077 (2008) - [c1]Zhihua Wei, Duoqian Miao, Jean-Hugues Chauchat, Caiming Zhong:
Feature Selection on Chinese Text Classification Using Character N-Grams. RSKT 2008: 500-507
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-15 23:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: