Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Junqian Wang

dblp:186/8968 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.512021
Adaptive Graph Completion Based Incomplete Multi-View Clustering · IEEE Trans. Multim. 2021
Data mining › clustering › multi-view clustering
incomplete multi-view clustering
0.512021
Adaptive Graph Completion Based Incomplete Multi-View Clustering · IEEE Trans. Multim. 2021
Data mining › clustering
multi-view clustering
0.512021
Adaptive Graph Completion Based Incomplete Multi-View Clustering · IEEE Trans. Multim. 2021
Machine learning › Representation and self-supervised learning › multi-view learning
consensus representation learning
0.112021
Adaptive Graph Completion Based Incomplete Multi-View Clustering · IEEE Trans. Multim. 2021

Methods — techniques the papers use, named apart from their topics

graph completion · 1.0adaptive weighting · 1.0
YearPublicationVenuePosition
2021 Adaptive Graph Completion Based Incomplete Multi-View Clustering
abstract
In real-world applications, it is often that the collected multi-view data are incomplete, i.e., some views of samples are absent. Existing clustering methods for incomplete multi-view data all focus on obtaining a common representation or graph from the available views but neglect the hidden information of missing views and information imbalance of different views. To solve these problems, a novel method, called adaptive graph completion based incomplete multi-view clustering (AGC_IMC), is proposed in this paper. Specifically, AGC_IMC develops a joint framework for graph completion and consensus representation learning, which mainly contains three components, i.e., within-view preservation, between-view inferring, and consensus representation learning. To reduce the negative influence of information imbalance, AGC_IMC introduces some adaptive weights to balance the importance of different views during the consensus representation learning. Importantly, AGC_IMC has the potential to recover the similarity graphs of all views with the optimal cluster structure, which encourages it to obtain a more discriminative consensus representation. Experimental results on five well-known datasets show that AGC_IMC significantly outperforms the state-of-the-art methods.
Jie Wen 0001, Ke Yan 0003, Zheng Zhang 0006, Yong Xu 0001, Junqian Wang, Lunke Fei, Bob Zhang 0001
IEEE Trans. Multim.5
2020 Pixel re-representations for better classification of images
Junqian Wang, Peiyi Han, Chuanyi Liu, Yong Xu 0001
Pattern Recognit. Lett.1
2019 Advancement in Bedfast Lake ICE Mapping From Sentinel-1 Sar Data
abstract
Algorithms for the generation of a bedfast/floating lake ice product from Sentinel-1A/B synthetic aperture radar (SAR) data were implemented, cross-compared, and validated for various permafrost regions (Alaska, Canada and Russia). The algorithms consisted of: 1) thresholding; 2) Iteration Region Growing with Semantics (IRGS); and 3) K-means. The thresholding algorithm (92.4%) was found to perform slightly better on average than the IRGS algorithm (90.1%), and to outperform K-means (85.3%). The thresholding algorithm was therefore selected for implementation of a processing chain to generate a novel bedfast/floating lake ice product. Using a time series of Sentinel-1 SAR data, the new map product shows the day of year (DOY) when the ice becomes bedfast or remains afloat for individual lake sections.
Claude R. Duguay, Junqian Wang
IGARSS2
2019 Combining dissimilarity measures for image classification
Chuanyi Liu, Junqian Wang, Shaoming Duan, Yong Xu 0001
Pattern Recognit. Lett.2