Can Chen

Anchor-based Multi-view Clustering (MVC) is widely adopted as an efficient paradigm for large-scale data fusion. However, existing approaches suffer from two critical limitations: (1) they neglect the intrinsic uniqueness of individual views by overemphasizing cross-view commonalities , and (2) they ignore the geometric properties of anchors , resulting in an Ambiguous Anchor Graph (AAG) that degrades clustering performance. To address these challenges, we propose a novel framework termed Scalable Multi-view Subspace Clustering with View Rarity Analysis (SMSC-VRA). Specifically, SMSC-VRA introduces a View Rarity metric to explicitly quantify the statistical uniqueness of each view , thereby preserving and amplifying rare yet highly informative views during data fusion. Furthermore, it integrates a geometric regularization scheme to learn distinct anchors based on manifold alignment , constructing a robust Distinguishable Anchor Graph (DAG) that eliminates ambiguous sample-anchor assignments. Crucially, the entire optimization process scales linearly ($O(n)$) with respect to the sample size , guaranteeing high computational efficiency. Extensive experiments across diverse benchmark datasets demonstrate the clear superiority of SMSC-VRA over state-of-the-art methods. Notably, on massive datasets such as YTF100, our framework delivers high-quality clustering boundaries while successfully avoiding the out-of-memory (OOM) failures that plague competing approaches.

In the domain of Multi-view Subspace Clustering (MSC) in Latent Embedding Space (LES), existing methods aim to capture and leverage critical multi-view information by mapping it into a low-dimensional LES. However, several aspects can be further improved: (i) Fusion Strategy: Existing methods adopt either early fusion or late fusion to integrate multi-view information, limiting the effectiveness of the fusion. (ii) Diversity: Current methods often overlook the inherent diversity in the multi-view data by focusing on a single LES. (iii) Efficiency: LES-based methods exhibit high computational complexity, with cubic time and quadratic space requirements based on the number of samples. To address these issues, we propose a novel framework called MSC-DOLES (Multi-view Subspace Clustering in Diverse Orthogonal Latent Embedding Spaces), a novel framework designed to tackle these challenges. MSC-DOLES incorporates a two-stage fusion approach that generates and learns from multiple LES to maximize cross-view diversity. Orthogonality constraints on individual LES ensure view-internal diversity, resulting in a set of Diverse Orthogonal Latent Embedding Spaces (DOLES). The DOLES are then fused into a consensus anchor graph using learnable anchors. The final clustering is induced by partitioning the obtained graph without pre-processing. We develop an eight-step optimization algorithm for MSC-DOLES, which exhibits nearly linear time and space complexities relative to the number of samples. Extensive experiments demonstrate the superiority of MSC-DOLES over state-of-the-art methods.

Multiview clustering (MVC) has been widely studied in machine learning and data mining for its capability of improving clustering performance by fusing the information from multiview data. In the past decade, a large number of MVC methods have made impressive progress, but most of them suffer from computational burdens, especially in large-scale tasks. Binary MVC (BMVC) is proposed to address this issue by representing the large-scale high-dimensional dataset as a group of consensus and low-dimensional binary codes. However, current BMVC-based approaches generate the clustering by executing binary $k$ -means on the obtained binary codes, which fail to capture the embedded geometric information, leading to poor clustering performance. In addition, parameter selection is another “mission impossible” in unsupervised learning tasks including MVC. To tackle these challenges, a framework of multiview clustering via partitioning the signed prototype graph (SPGMVC) is proposed in this work. The SPGMVC framework offers several contributions. First, SPGMVC is designed as a unified framework for MVC. It combines effective technologies, such as consensus binary coding, code compression (CC), signed prototype graph (SPG) partitioning, and prototype-based cluster assignment. Second, SPGMVC partitions the signed graph (SG) based on the relationships between positive and negative edges. By capturing the underlying structure of the data, this partitioning strategy improves clustering accuracy (ACC). CC techniques are applied to reduce the graph’s scale, enabling further partitioning and enhancing computational efficiency. Third, SPGMVC employs an alternate minimizing strategy to efficiently handle the optimization problem. This strategy has nearly linear time and space complexity with respect to the data volume, making it suitable for large-scale tasks. Fourth, SPGMVC proposes an automatic parameter selection strategy, eliminating the need for extensive parameter exploration. Comprehensive experiments illustrate the superiority of our model. The implementation of SPGMVC is available at: https://github.com/gepingyang/PSGMVC.

As the main detector of the Gravitational wave high-energy Electromagnetic Counterpart All-sky Monitor mission (GECAM), the calibration of the energy response and detection efficiency of the gamma-ray detector (GRD) is the main content of the ground-based calibration. This article mainly focuses on the calibration of the energy response and detection efficiency in the 8–160 keV with a refined measurement around the absorption edges of the lanthanum bromide crystal ($\rm {LaBr_3}$). The GRD performances for different crystal types, data acquisition modes, working modes, and incident positions are also analysed in detail. We show that the calibration campaign is comprehensive, the detector performance meets the flight requirements, and the calibration results generally agree with simulations as expected. The detector’s model was corrected by the ground-based calibration, which led to the establishment of the calibration data base.

Spectral Clustering (SC) is an effective clustering method for its excellent performance in partitioning non-linearly distributed data. On the other hand, Ensemble Clustering (EC), a different clustering technology, can promote cluster quality by ensembling the results of base clusterings. In this work, we concentrate on an EC framework that utilizes SC as the base method. Nevertheless, SC suffers from scalability due to its high computational complexity in constructing the Laplacian graph and computing the corresponding eigendecomposition. In the past decades, many efforts have been made to it. However, SC suffers from the scalability issue in processing extensive data, especially in web-scale scenarios. Additionally, EC requires multiple clustering results as the ensemble bases, which further aggravates resource consumption. To address this issue, LiteWSEC, a simple yet efficient Lightweight Framework for Web-scale Spectral Ensemble Clustering, is proposed to cluster web-scale data with limited resource requirements. It adopts the Web-scale Spectral Clustering (WSC) as the base method, which has minimal space overhead without computing overall embedding explicitly. LiteWSEC is highly flexible in the memory requirement, which is adaptive to the available resource. It can partition web-scale data (e.g., $n = 8,000~k$ ) in an resource-limited host (e.g., memory is restricted to 1 GB). Experiments on real-world, large-scale, and web-scale datasets demonstrate both the efficiency and effectiveness of LiteWSEC over state-of-the-art SC and EC methods.

There are various techniques have been proposed for constructing neural ranking models, including representation-based models and interaction-based models, both employ shallow or deep neural networks to tackle the reranking problem in document retrieval, in which query is usually the first met object before we focus on documents. Thus query can be treated as target when modeling the matching patterns between it and documents, however, few works have attempted to do that. In this paper we propose a target-oriented transformation networks based neural ranking model TTRM, which encodes the target information into the document content and utilizing a context conserving transformation to encapsulate the contextualized features. By this way, can the model produce a new target-derived word level representations for the document, from which the salient abstract features can be extracted using a convolution network, and the final relevance score between the query-document pair can be obtained by stacking a feed forward network. The comparison results show that our proposed model can outperform the baseline models on two important evaluation metrics when conducting experiments on the benchmark collection.