Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unified View Imputation and Feature Selection Learning for Incomplete Multi-view Data (2401.10549v1)

Published 19 Jan 2024 in cs.LG

Abstract: Although multi-view unsupervised feature selection (MUFS) is an effective technology for reducing dimensionality in machine learning, existing methods cannot directly deal with incomplete multi-view data where some samples are missing in certain views. These methods should first apply predetermined values to impute missing data, then perform feature selection on the complete dataset. Separating imputation and feature selection processes fails to capitalize on the potential synergy where local structural information gleaned from feature selection could guide the imputation, thereby improving the feature selection performance in turn. Additionally, previous methods only focus on leveraging samples' local structure information, while ignoring the intrinsic locality of the feature space. To tackle these problems, a novel MUFS method, called UNified view Imputation and Feature selectIon lEaRning (UNIFIER), is proposed. UNIFIER explores the local structure of multi-view data by adaptively learning similarity-induced graphs from both the sample and feature spaces. Then, UNIFIER dynamically recovers the missing views, guided by the sample and feature similarity graphs during the feature selection procedure. Furthermore, the half-quadratic minimization technique is used to automatically weight different instances, alleviating the impact of outliers and unreliable restored data. Comprehensive experimental results demonstrate that UNIFIER outperforms other state-of-the-art methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Multi-view feature selection via nonnegative structured graph learning. Neurocomputing, 387:110–122, 2020.
  2. J.T. Barron. A general and adaptive robust loss function. In Proc. IEEE/CVF Int. Conf. Comput. Vis. Pattern Recognit., pages 4331–4339, 2019.
  3. Deep adversarial learning for multi-modality missing data completion. In Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, pages 1158–1166, 2018.
  4. Multi-view unsupervised complementary feature selection with multi-order similarity learning. Knowl. Based Syst., 283:111172, 2024.
  5. Generalized nonconvex low-rank tensor approximation for multi-view subspace clustering. IEEE Trans. Image Process., 30:4022–4035, 2021.
  6. Clustering with multi-layer graphs: A spectral perspective. IEEE Trans. Signal Process., 60(11):5820–5831, 2012.
  7. Joint multi-view unsupervised feature selection and graph learning. IEEE Trans. Emerg. Top. Comput. Intell., 1:1–16, 2023.
  8. Laplacian score for feature selection. In Adv. Neural Inf. Process. Syst., pages 507–514, 2005.
  9. Joint embedding learning and sparse regression: A framework for unsupervised feature selection. IEEE Trans. Cybern., 44(6):793–804, 2013.
  10. Multi-view spectral clustering network. In Proc. Int. Joint Conf. Artif. Intell., pages 2563–2569, 2019.
  11. Discriminative and uncorrelated feature selection with constrained spectral analysis in unsupervised learning. IEEE Trans. Image Process., 29:2139–2149, 2019.
  12. Dual contrastive prediction for incomplete multi-view representation learning. IEEE Trans. Pattern Anal. Mach. Intell., 45(4):4447–4461, 2022.
  13. Robust multi-view feature selection. In Proc. IEEE Int. Conf. Data Mining, pages 281–290, 2016.
  14. Multiview dimension reduction via hessian multiset canonical correlations. Inf. Fusion, 100(41):119–128, 2018.
  15. Locality-constrained concept factorization. In Proc. Int. Joint Conf. Artif. Intell., pages 1378–1383, 2021.
  16. Self-representation subspace clustering for incomplete multi-view data. In Proc. ACM Int. Conf. Multimedia, pages 2726–2734, 2021.
  17. Efficient and robust feature selection via joint ℓ2,1subscriptℓ21\ell_{2,1}roman_ℓ start_POSTSUBSCRIPT 2 , 1 end_POSTSUBSCRIPT-norms minimization. In Adv. Neural Inf. Process. Syst., pages 1–9, 2010.
  18. Structured graph optimization for unsupervised feature selection. IEEE Trans. Knowl. Data Eng., 33(3):1210–1222, 2019.
  19. Fast sparse discriminative k-means for unsupervised feature selection. IEEE Trans. Neural Netw. Learn. Syst., 1:1–15, 2023.
  20. M. Nikolova and R.H. Chan. The equivalence of half-quadratic minimization and the gradient linearization iteration. IEEE Trans. Image Process., 16(6):1623–1627, 2007.
  21. A. Rocha and S.K. Goldenstein. Multiclass from binary: Expanding one-versus-all, one-versus-one and ecoc-based approaches. IEEE Trans. Neural Netw. Learn. Syst., 25(2):289–302, 2013.
  22. Half-quadratic minimization for unsupervised feature selection on incomplete data. IEEE Trans. Neural Netw. Learn. Syst., 32(7):3122–3135, 2020.
  23. Unsupervised adaptive feature selection with binary hashing. IEEE Trans. Image Process., 32:838–853, 2023.
  24. Cross-view locality preserved diversity and consensus learning for multi-view unsupervised feature selection. IEEE Trans. Knowl. Data Eng., 34(10):4705–4716, 2021.
  25. Gmc: Graph-based multi-view clustering. IEEE Trans. Knowl. Data Eng., 32(6):1116–1129, 2019.
  26. Unified embedding alignment with missing views inferring for incomplete multi-view clustering. In Proc. AAAI Conf. Artif. Intell., pages 5393–5400, 2019.
  27. Unsupervised cross-view feature selection on incomplete data. Knowl. Based Syst., 234:107595, 2021.
  28. Multi-view unsupervised feature selection with tensor low-rank minimization. Neurocomputing, 487:75–85, 2022.
  29. Conjugate gradient least squares algorithm for solving the generalized coupled sylvester matrix equations. Comput. Math. with Appl., 73(12):2529–2547, 2017.
  30. Feature selection with multi-view data: A survey. Inf. Fusion, 50:158–167, 2019.
  31. Unsupervised feature selection via adaptive graph learning and constraint. IEEE Trans. Neural Netw. Learn. Syst., 33(3):1355–1362, 2020.
  32. Flexible multi-view unsupervised graph embedding. IEEE Trans. Image Process., 30:4143–4156, 2021.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets