A mutual neighbor-based clustering method and its medical applications.

Clustering analysis has been widely used in various real-world applications. Due to the simplicity of K-means, it has become the most popular clustering analysis technique in reality. Unfortunately, the performance of K-means heavily relies on initial centers, which should be specified in prior.

Iterative Deep Structural Graph Contrast Clustering for Multiview Raw Data.

Multiview clustering has attracted increasing attention to automatically divide instances into various groups without manual annotations. Traditional shadow methods discover the internal structure of data, while deep multiview clustering (DMVC) utilizes neural networks with clustering-friendly data embeddings. Although both of them achieve impressive performance in practical applications, we find that the former heavily relies on the quality of raw features, while the latter ignores the structure information of data.

Localized Simple Multiple Kernel K-Means Clustering with Matrix-Induced Regularization.

Multikernel clustering achieves clustering of linearly inseparable data by applying a kernel method to samples in multiple views. A localized SimpleMKKM (LI-SimpleMKKM) algorithm has recently been proposed to perform min-max optimization in multikernel clustering where each instance is only required to be aligned with a certain proportion of the relatively close samples. The method has improved the reliability of clustering by focusing on the more closely paired samples and dropping the more distant ones.

Serum-based surface-enhanced Raman spectroscopy combined with PCA-RCKNCN for rapid and accurate identification of lung cancer.

Early and precise diagnosis of lung cancer is critical for a better prognosis. However, it is still a challenge to develop an effective strategy for early precisely diagnose and effective treatments. Here, we designed a label-free and highly accurate classification serum analytical platform for identifying mice with lung cancer.

Region-Aware Hierarchical Latent Feature Representation Learning-Guided Clustering for Hyperspectral Band Selection.

Hyperspectral band selection aims to identify an optimal subset of bands for hyperspectral images (HSIs). For most existing clustering-based band selection methods, they directly stretch each band into a single feature vector and employ the pixelwise features to address band redundancy. In this way, they do not take full consideration of the spatial information and deal with the importance of different regions in HSIs, which leads to a nonoptimal selection.

Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance.

Multi-view subspace clustering has attracted intensive attention to effectively fuse multi-view information by exploring appropriate graph structures. Although existing works have made impressive progress in clustering performance, most of them suffer from the cubic time complexity which could prevent them from being efficiently applied into large-scale applications. To improve the efficiency, anchor sampling mechanism has been proposed to select vital landmarks to represent the whole data.

Localized Incomplete Multiple Kernel k-Means With Matrix-Induced Regularization.

Localized incomplete multiple kernel k -means (LI-MKKM) is recently put forward to boost the clustering accuracy via optimally utilizing a quantity of prespecified incomplete base kernel matrices. Despite achieving significant achievement in a variety of applications, we find out that LI-MKKM does not sufficiently consider the diversity and the complementary of the base kernels. This could make the imputation of incomplete kernels less effective, and vice versa degrades on the subsequent clustering.

Absent Multiple Kernel Learning Algorithms.

Multiple kernel learning (MKL) has been intensively studied during the past decade. It optimally combines the multiple channels of each sample to improve classification performance. However, existing MKL algorithms cannot effectively handle the situation where some channels of the samples are missing, which is not uncommon in practical applications.

Multiple Kernel k-Means with Incomplete Kernels.

Multiple kernel clustering (MKC) algorithms optimally combine a group of pre-specified base kernel matrices to improve clustering performance. However, existing MKC algorithms cannot efficiently address the situation where some rows and columns of base kernel matrices are absent. This paper proposes two simple yet effective algorithms to address this issue.

Late Fusion Incomplete Multi-View Clustering.

Incomplete multi-view clustering optimally integrates a group of pre-specified incomplete views to improve clustering performance. Among various excellent solutions, multiple kernel $k$k-means with incomplete kernels forms a benchmark, which redefines the incomplete multi-view clustering as a joint optimization problem where the imputation and clustering are alternatively performed until convergence. However, the comparatively intensive computational and storage complexities preclude it from practical applications.

Radiomic signature as a diagnostic factor for histologic subtype classification of non-small cell lung cancer.

Objectives: To distinguish squamous cell carcinoma (SCC) from lung adenocarcinoma (ADC) based on a radiomic signature METHODS: This study involved 129 patients with non-small cell lung cancer (NSCLC) (81 in the training cohort and 48 in the independent validation cohort). Approximately 485 features were extracted from a manually outlined tumor region. The LASSO logistic regression model selected the key features of a radiomic signature.