Demo Data from EDBT 2026 / reviewers in the wild / expert
Dongyuan Wei
dblp:389/2623
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0008-5441-917XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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.
| Artificial intelligence
1 paper |
Representation and self-supervised learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view clustering |
0.8 | 1 | 2024 | Multi-View Clustering Based on Deep Non-negative Tensor Factorization · ACM Multimedia 2024 |
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view representation learning |
0.8 | 1 | 2024 | Multi-View Clustering Based on Deep Non-negative Tensor Factorization · ACM Multimedia 2024 |
Machine learning › Representation and self-supervised learning › matrix factorization
nonnegative matrix factorization |
0.8 | 1 | 2024 | Multi-View Clustering Based on Deep Non-negative Tensor Factorization · ACM Multimedia 2024 |
Methods — techniques the papers use, named apart from their topics
tensor schatten p-norm regularization · 0.8deep non-negative tensor factorization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Multi-View Clustering Based on Deep Non-negative Tensor FactorizationabstractMulti-view clustering (MVC) methods based on non-negative matrix factorization (NMF) have gained popularity owing to their ability to provide interpretable clustering results. However, these NMF-based MVC methods generally process each view independently and thus ignore the potential relationship between views. Besides, they are limited in the ability to capture nonlinear data structures. To overcome these weaknesses and inspired by deep learning, we propose a multi-view clustering method based on deep non-negative tensor factorization (MVC-DNTF). With deep tensor factorization, our method can well exploit the spatial structure of the original data and is capable of extracting more deep and nonlinear features embedded in different views. To further extract the complementary information of different views, we adopt the weighted tensor Schatten p-norm regularization term. An optimization algorithm is developed to effectively solve the MVC-DNTF objective. Extensive experiments are performed to demonstrate the effectiveness and superiority of our method. Wei Feng 0010, Dongyuan Wei, Qianqian Wang 0001, Bo Dong 0001, Quanxue Gao |
ACM Multimedia | 2 |
| 2024 | Blind Signature Based Anonymous Authentication on Trust for Decentralized Mobile CrowdsourcingabstractMobile Crowdsourcing (MCS) is a widely adopted data collection method that utilizes ubiquitous mobile devices as sensors. The centralized nature of traditional MCS introduces certain weaknesses, leading to a growing interest in blockchainbased MCS. Although decentralized MCS proves to be effective, it also presents several privacy and trust concerns. Specifically, ensuring node trust authentication in an anonymous and decentralized manner is critical due to the susceptibility of a trustworthy and decentralized MCS platform to various attacks. Nevertheless, the absence of a centralized and trusted entity in blockchain poses significant challenges in managing node keys for authentication. Moreover, trust often conflicts with privacy, and the transparency of blockchain further complicates the achievement of anonymous authentication while preserving privacy. To address these challenges, we propose a scheme for decentralized anonymous authentication based on threshold and partial blind signature, which provides a key alternation service. The proposed scheme enables trust credential issuance without disclosing the linkable relationship between the public keys before and after the alternation. Extensive analyses and experiments are conducted to demonstrate the security and efficiency of the proposed scheme. Wei Feng 0010, Dongyuan Wei, Qianqian Wang 0001 |
TrustCom | 2 |