arXiv:2304. 11171v5 Announce Type: replace-cross Abstract: To overcome the limitations of point-based inputs, overly fine computation and limited adaptability in existing artificial intelligence methods, Guoyin Wang and Shuyin Xia proposed granular-ball computing as a new artificial intelligence learning paradigm.
arXiv:2605. 08759v3 Announce Type: replace Abstract: Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clustering.
arXiv:2608. 12903v1 Announce Type: new Abstract: The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks.
arXiv:2607. 29115v1 Announce Type: cross Abstract: Link prediction aims to identify potential or future connections within a given graph structure.
arXiv:2606. 12077v1 Announce Type: new Abstract: Time-series clustering remains challenging due to the inherent trade-off between clustering effectiveness and computational efficiency.
arXiv:2404. 03082v3 Announce Type: replace Abstract: Partially ordered sets (posets) are discrete mathematical structures that formalize the notion of comparison without forcing every pair of objects to be comparable.
arXiv:2607. 21381v1 Announce Type: new Abstract: Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph.
arXiv:2608. 11704v1 Announce Type: cross Abstract: Dynamic Time Warping (DTW)-based Nearest-Neighbor (NN) classifiers are effective for time-series classification but are vulnerable to mislabeled training samples and require numerous DTW computations during inference.
arXiv:2607. 02266v1 Announce Type: cross Abstract: Most data-mixing methods assume the corpus has already been partitioned into groups, and the choice of those groups determines what a mixer can express.
arXiv:2605. 22410v2 Announce Type: replace Abstract: Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging.
Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph. Previous methods explain graph neural networks (GNNs) by selecting important edges to induce subgraphs, where edge importance is assessed by perturbing each edge and observing changes in the model predictions.
arXiv:2604. 04969v2 Announce Type: replace-cross Abstract: Retrieval-Augmented Generation (RAG) mitigates hallucinations in Multimodal Large Language Models (MLLMs), yet existing systems struggle with complex cross-modal reasoning.
arXiv:2601. 06135v3 Announce Type: replace Abstract: Spatial computation in geographic systems increasingly requires query-conditioned, local, interpretable aggregation under metric constraints.