Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Kernel-Based Sparse Representation Learning With Global and Local Low-Rank Label Constraint

Bibliographic Data

ID22107272
AuthorsLuyao Teng (0000-0002-3872-4085, Guangzhou Panyu Polytechnic), Feiyi Tang (Guangzhou Panyu Polytechnic), Zefeng Zheng (0000-0003-0748-4346, Guangdong University of Technology), Peipei Kang (0000-0001-8637-051X, Guangdong University of Technology), Shaohua Teng (0000-0002-7204-1288, Guangdong University of Technology)
Year2024
Volume11
Issue1
Pages488-502
Publication date2024-02-01
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueIEEE Transactions on Computational Social Systems (JOURNAL)
Journal identifiersISSN: 2329-924X • E-ISSN: 2373-7476
PublisherInstitute of Electrical and Electronics Engineers (IEEE) (PUBLISHER)
DOI10.1109/tcss.2022.3227406
OpenAlexW4312786934
LanguageEN
References cited59

Due to the large-scale and multiscale natures of social media data, sparse representation (SR) learning methods are widely followed. However, there are three problems associated with the existing SR methods: 1) they neglect the fact that the semantic features of data may change during iterative learning, which leads to weak semantic learning; 2) they often assume that the data are linearly separable, while the data might be nonlinear in many real-world applications; and 3) they cannot ensure the low-rank and discriminative properties of the data at the same time and might neglect the global properties of the data, leading to suboptimal solutions. To solve these problems, we propose a novel method, named kernel-based SR learning with global and local low-rank label (KSR-GL3) constraint, which strengthens the semantic information and ensures the semantic features invariant during learning. First, we map the data into a high-dimensional feature space to learn the linear representation of samples. Second, global and local low-rank label (GL3) constraint is used to ensure the semantic invariance, low-rankness, and discrimination of features during learning. Third, an $\ell _{2,1}$ is imposed to explore the sparseness of the subspace. Mathematical analyses show that GL3 can retain the intrinsic properties of data during learning. By combining the above three components, a generalized power iteration (GPI) approach is applied to build the model and deal with the tricky optimization problem. By KSR-GL 3, a sparse, low-rank, and discriminative subspace is produced from the high-dimensional and orthogonal representation of the data under the guidance of semantics, while the intrinsic properties of data are preserved. Extensive experiments on six datasets compared with five advanced algorithms demonstrate its promising prospects

Arithmetic · Combinatorics · Discrete mathematics · Machine learning · Notation · Search engine indexing · Computer Science · Domain Adaptation and Few-Shot Learning · Face and Expression Recognition · Mathematics · Text and Document Classification Technologies · Artificial Intelligence · Theoretical Computer Science

  • Mitigating the Impact of Data Sampling on Social Media Analysis and Mining

    Open Access•Kuai Xu, Feng Wang et al.•IEEE Transactions on Computational…•2020

  • Fast Asymmetric and Discrete Cross-Modal Hashing With Semantic Consistency

    Open Access•Shaohua Teng, Chengzhen Ning et al.•IEEE Transactions on Computational…•2023

Citation velocityhistorical
Highly citedNo

Tools

Open DOI
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae