While AUC maximizing support vector machine (AUCSVM) has been developed to solve imbalanced classification tasks, its huge computational burden will make AUCSVM become impracticable and even computationally forbidden for medium or large-scale imbalanced data. In addition, minority class sometimes means extremely important information for users or is corrupted by noises and/or outliers in practical application scenarios such as medical diagnosis, which actually inspires us to generalize the AUC concept to reflect such importance or upper bound of noises or outliers. In order to address these issues, by means of both the generalized AUC metric and the core vector machine (CVM) technique, a fast AUC maximizing learning machine, called $\rho $ -AUCCVM, with simultaneous outlier detection is proposed in this study. $\rho $ -AUCCVM has its notorious merits: 1) it indeed shares the CVM’s advantage, that is, asymptotically linear time complexity with respect to the total number of sample pairs, together with space complexity independent on the total number of sample pairs and 2) it can automatically determine the importance of the minority class (assuming no noise) or the upper bound of noises or outliers. Extensive experimental results about benchmarking imbalanced datasets verify the above advantages of $\rho $ -AUCCVM.
7 August 2025 in IEEE Transactions on Fuzzy Systems
While existing graph clustering methods can only be oriented to classical graphic data, this study as the first attempt focuses on the proposed symmetric-tensor based graph and its clustering algorithm. To this end, the concept of fuzzy overlapping modularity is defined and then is extended into its generalized version for symmetric-tensor based graph. Subsequently, based on the principle of maximizing the symmetric-tensor based fuzzy overlapping modularity, a novel learning objective is derived for fuzzy clustering, and the corresponding clustering algorithm FOMC is also proposed. In addition, with only one additional hyperparameter, the semi-supervised clustering algorithm SFOMC is also derived for symmetric-tensor based graph with some labeled samples. Extensive experimental results on synthetic and real benchmarking datasets verify the clustering power of both FOMC and SFOMC on symmetric-tensor based graphs. In particular, FOMC achieves 13.94% improvement over the average performance of the comparative methods on the adopted real networks, and SFOMC's clustering performance increment becomes 1.799 times higher than the average value of the comparative methods when samples have been labeled from 5% to 25% in the adopted graphs.
Background: Hepatocellular Carcinoma (HCC) is one of the most common malignant tumors. Due to the insidious onset and poor prognosis, most patients have reached the advanced stage at the time of diagnosis. Objective: Studies have shown that Dynamic Network Biomarkers (DNB) can effectively identify the critical state of complex diseases such as HCC from normal state to disease state. Therefore, it is very important to detect DNB efficiently and reliably. Methods: This paper selects a dataset containing eight HCC disease states. First, an individual-specific network is constructed for each sample and features are extracted. In the context of this network, a simulated annealing algorithm is used to search for potential dynamic network biomarker modules, and the evolution of HCC is determined. Results: In fact, in the period of Low-Grade Dysplasia (LGD) and High-Grade Dysplasia (HGD), DNB sends an indicative warning signal, which means that liver dysplasia is a very important critical state in the development of HCC disease. Compared with landscape dynamic network biomarkers method (LDNB), our method can not only describe the statistical characteristics of each disease state, but also yield better results including getting more DNBs enriched in HCC related pathways. Conclusion: The results of this study may be of great significance to the prevention and early diagnosis of HCC.
This study has a novel model and adequate theory, but I still have some MINOR questions: 1. Is the account of experimental data not detailed enough (training set, test set)? Prove that this model has good generalization performance (predictive abilit...
Conventional clustering methods mainly characterize cluster structures using geometric proximity or pairwise similarities, which may be insufficient for data with complex higher-order dependencies. This paper proposes a Fuzzy Hypergraph Clustering (FHC) method that transforms ordinary feature data into a data-induced uniform hypergraph and performs clustering through higher-order modularity maximization. Specifically, local neighborhoods are first encoded as weighted hyperedges to represent multi-sample relations. A degree-corrected null model is then constructed, based on which fuzzy hypergraph modularity is defined to measure the excess concentration of observed higher-order relations within fuzzy clusters relative to random expectation. The proposed objective reduces to fuzzy graph modularity when the hyperedge order is two and, at unit resolution, further reduces to classical Newman–Girvan modularity under hard assignments. To optimize the resulting nonconvex objective, a simplex-constrained projected gradient ascent algorithm with Armijo backtracking is developed. The optimization is implemented directly over hyperedges without explicitly constructing the high-order adjacency tensor. Experiments on synthetic data and thirteen benchmark datasets show that FHC achieves the strongest overall ranking among the compared methods while maintaining stable performance over a broad parameter range and competitive computational cost. On the Alzheimer’s MRI dataset, FHC obtains the best NMI and ARI and the second-best ACC, further supporting the effectiveness of higher-order fuzzy modularity for clustering feature data with complex relational structures.