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

Huanhuan Lian

dblp:231/6524 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0001-5635-4113ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Artificial intelligence and machine learning · 1Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021

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
2 papers
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.922021
iCmSC: Incomplete Cross-Modal Subspace Clustering · IEEE Trans. Image Process. 2021
Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis · AAAI 2020
Data mining › clustering › high-dimensional clustering
subspace clustering
0.922021
iCmSC: Incomplete Cross-Modal Subspace Clustering · IEEE Trans. Image Process. 2021
Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis · AAAI 2020
Data mining › clustering › multi-modal clustering
cross-modal clustering
0.512021
iCmSC: Incomplete Cross-Modal Subspace Clustering · IEEE Trans. Image Process. 2021
Data mining › clustering › high-dimensional clustering › subspace clustering
multi-view subspace clustering
0.512021
iCmSC: Incomplete Cross-Modal Subspace Clustering · IEEE Trans. Image Process. 2021
Machine learning › Representation and self-supervised learning › multi-view learning
canonical correlation analysis
0.412020
Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis · AAAI 2020
Machine learning › Representation and self-supervised learning › multi-view learning › canonical correlation analysis
deep canonical correlation analysis
0.412020
Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis · AAAI 2020

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

self-expressive layer · 0.9correlation constraint · 0.9convolutional encoder · 0.9ℓ1,2-norm regularization · 0.5exclusive representation · 0.5deep canonical correlation analysis · 0.5
YearPublicationVenuePosition
2023 Efficient and Strong Symmetric Password Authenticated Key Exchange With Identity Privacy for IoT
abstract
Password authenticated key exchange (PAKE) allows two parties with a shared password to establish a session key. In order to provide secure and private communication between devices in an Internet of Things (IoT) environment, the PAKE protocol is considered one of the most common and promising security methods. However, many existing PAKE proposals still face challenges in security and efficiency. First, both the terminals of participants may suffer from the compromise attack and precomputation attack, which will lead to the leakage of password. Second, the majority of the existing schemes cannot guarantee participants’ identity privacy. Third, most PAKE protocols are not suitable for IoT devices with limited computing capability because of a large number of exponential and pairing operations. To address these issues, we propose a strong symmetric PAKE protocol for IoT devices, which only requires 3 exponentiations per party. The proposed scheme can protect both parties from compromise and precomputation attacks, in which the password file relies on the identity and random salt. What’s more, our protocol guarantees the identity privacy, that is, the transmitted record and password file will not reveal the identity information. We further present a new security model for our protocol, and prove that the proposed scheme is secure under this model. Finally, we show the practicality of our PAKE via experiments and efficiency analysis.
Huanhuan Lian, Yafang Yang, Yunlei Zhao
IEEE Internet Things J.1
2021 Identity-Based Identity-Concealed Authenticated Key Exchange
Huanhuan Lian, Tianyu Pan 0002, Huige Wang, Yunlei Zhao
ESORICS (2)1
2021 iCmSC: Incomplete Cross-Modal Subspace Clustering
abstract
Cross-modal clustering aims to cluster the high-similar cross-modal data into one group while separating the dissimilar data. Despite the promising cross-modal methods have developed in recent years, existing state-of-the-arts cannot effectively capture the correlations between cross-modal data when encountering with incomplete cross-modal data, which can gravely degrade the clustering performance. To well tackle the above scenario, we propose a novel incomplete cross-modal clustering method that integrates canonical correlation analysis and exclusive representation, named incomplete Cross-modal Subspace Clustering (i.e., iCmSC). To learn a consistent subspace representation among incomplete cross-modal data, we maximize the intrinsic correlations among different modalities by deep canonical correlation analysis (DCCA), while an exclusive self-expression layer is proposed after the output layers of DCCA. We exploit a ℓ1,2-norm regularization in the learned subspace to make the learned representation more discriminative, which makes samples between different clusters mutually exclusive and samples among the same cluster attractive to each other. Meanwhile, the decoding networks are employed to reconstruct the feature representation, and further preserve the structural information among the original cross-modal data. To the end, we demonstrate the effectiveness of the proposed iCmSC via extensive experiments, which can justify that iCmSC achieves consistently large improvement compared with the state-of-the-arts.
Qianqian Wang 0001, Huanhuan Lian, Gan Sun, Quanxue Gao, Licheng Jiao
IEEE Trans. Image Process.2
2020 Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis
abstract
For cross-modal subspace clustering, the key point is how to exploit the correlation information between cross-modal data. However, most hierarchical and structural correlation information among cross-modal data cannot be well exploited due to its high-dimensional non-linear property. To tackle this problem, in this paper, we propose an unsupervised framework named Cross-Modal Subspace Clustering via Deep Canonical Correlation Analysis (CMSC-DCCA), which incorporates the correlation constraint with a self-expressive layer to make full use of information among the inter-modal data and the intra-modal data. More specifically, the proposed model consists of three components: 1) deep canonical correlation analysis (Deep CCA) model; 2) self-expressive layer; 3) Deep CCA decoders. The Deep CCA model consists of convolutional encoders and correlation constraint. Convolutional encoders are used to obtain the latent representations of cross-modal data, while adding the correlation constraint for the latent representations can make full use of the information of the inter-modal data. Furthermore, self-expressive layer works on latent representations and constrain it perform self-expression properties, which makes the shared coefficient matrix could capture the hierarchical intra-modal correlations of each modality. Then Deep CCA decoders reconstruct data to ensure that the encoded features can preserve the structure of the original data. Experimental results on several real-world datasets demonstrate the proposed method outperforms the state-of-the-art methods.
Quanxue Gao, Huanhuan Lian, Qianqian Wang 0001, Gan Sun
AAAI2