Showing 81 - 100 results of 2,620 for search '"Five Ranks', query time: 0.10s Refine Results
  1. 81
  2. 82
  3. 83
  4. 84
  5. 85
  6. 86
  7. 87
  8. 88
  9. 89
  10. 90
  11. 91
  12. 92
  13. 93
  14. 94

    Robust feature selection method via joint low-rank reconstruction and projection reconstruction by Shuangyan YI, Yongsheng LIANG, Jingjing LU, Wei LIU, Tao HU, Zhenyu HE

    Published 2023-03-01
    “…Aiming at the problem that current feature selection methods were still affected by noise and cannot effectively unify clustering and reconstruction effects, a robust feature selection method was proposed.A robust reconstruction error term was built by making the difference between low-rank reconstruction and projection reconstruction.After that, the features for clustering were selected from the reconstructed data instead of the original data.The learning of clean data and feature selection technique are allowed for joint learning and promote each other, thereby improving the robustness of the method on noisy data, and effectively unifying reconstruction and clustering.Compared with several kinds of graph embedding feature selection and reconstruction feature selection methods on five datasets, the experimental results showed that, except for the LUNG noise dataset, the proposed method outperforms the comparative feature selection method under both evaluation indicators (ACC and NMI).…”
    Get full text
    Article
  15. 95

    Scientific management school problem’s evolution (based on highly ranked Russian scientific journals) by I. K. Bitkina

    Published 2022-12-01
    “…The analysis was based on highly ranked publications. The information base consisted of 38 articles from five peer-reviewed scientific journals included in the Russian Science Citation Index (RSCI) database, and international citation databases. …”
    Get full text
    Article
  16. 96

    Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six by J. Cervantes-Ojeda, M. Gómez-Fuentes, D. González-Moreno, M. Olsen

    Published 2019-01-01
    “…A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths. …”
    Get full text
    Article
  17. 97
  18. 98
  19. 99
  20. 100