Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,932 papers · 148 categories
Trend · papers per month
48 results for “collective classification”
Classifies collective motions in biological networks using graph dynamic mode decomposition.
problem Classifying complex collective motions in biological networks based on transient and complexly changing network properties.
method Data-driven spectral analysis (graph dynamic mode decomposition) to extract dynamical properties.
result Contextual node information and physical properties are crucial for classifying collective motions.
Relational learning deals with data that are characterized by relational structures. An important task is collective classification, which is to jointly classify networked objects. While it holds a great promise to produce a better accuracy than non-collective classifiers, collective classification is computational cha…
Crowdsourcing utilizes the wisdom of crowds for collective classification via information (e.g., labels of an item) provided by labelers. Current crowdsourcing algorithms are mainly unsupervised methods that are unaware of the quality of crowdsourced data. In this paper, we propose a supervised collective classificatio…
Boost GNNs for node classification by incorporating label dependencies.
problem Current GNNs lack expressiveness and fail to capture label dependencies.
method Proposes a collective learning framework combining collective classification and self-supervised learning.
result Consistent, significant improvement in node classification accuracy across various GNNs.
This paper introduces collective counterfactual explanations for groups of instances in classification models.
problem Understanding how classification models make decisions for groups of instances.
method Novel Mathematical Optimization models to find collective counterfactual explanations that minimize total perturbation cost.
result Detects critical features for entire dataset classification and handles outliers.
Modern machine learning-based recognition approaches require large-scale datasets with large number of labelled training images. However, such datasets are inherently difficult and costly to collect and annotate. Hence there is a great and growing interest in automatic dataset collection methods that can leverage the w…
Approach collects missing outcomes to improve fairness in classification.
problem Lack of true outcomes for incorrectly classified samples leads to biased classifiers.
method Exploration-based data collection to ensure all subpopulations are represented and fairness properties are encoded.
result Trained classifier converges to a fair classifier with bounded false positives.
The paper develops a decision support system for hierarchical text classification of conference proceedings.
problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.
Study on error probability for classification of heavy-tailed renewal processes.
problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.
Proposes a method for selecting important variables in high-dimensional data.
problem High-dimensional classification problems with many noise variables.
method Probability-based nonparametric multiple-class classification method with variable selection.
result The method can have prediction power similar to Bayes rule and retains interpretability.
New loss improves OOD detection without extra data or tuning.
problem Improving OOD detection without additional data or tuning.
method Proposed IsoMax loss and entropic score to replace SoftMax loss.
result Training with IsoMax loss significantly improves OOD detection performance.
We determine the extent to which the collection of -Euler-Satake characteristics classify closed 2-orbifolds. In particular, we show that the closed, connected, effective, orientable 2-orbifolds are classified by the collection of -Euler-Satake characteristics corresponding to free or free abelian and are not…
Collecting labeled data is costly and thus a critical bottleneck in real-world classification tasks. To mitigate this problem, we propose a novel setting, namely learning from complementary labels for multi-class classification. A complementary label specifies a class that a pattern does not belong to. Collecting compl…
Meta-learning improves model performance by optimizing data acquisition.
problem Lack of operationally realistic data limits model performance.
method Gaussian process surrogate fit to metadata-driven training data variations.
result Meta-learning enhances model performance compared to random data acquisition.
This work introduces a tensor-based method to perform supervised classification on spatiotemporal data processed in an echo state network. Typically when performing supervised classification tasks on data processed in an echo state network, the entire collection of hidden layer node states from the training dataset is …
We prove uniqueness of the near-horizon geometries arising from degenerate Kerr black holes within the collection of nearby vacuum near-horizon geometries.
Many classification problems involve data instances that are interlinked with each other, such as webpages connected by hyperlinks. Techniques for "collective classification" (CC) often increase accuracy for such data graphs, but usually require a fully-labeled training graph. In contrast, we examine how to improve the…
Extracts geometric information from point-clouds for multiclass classification.
problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
Study shows small groups can influence machine learning algorithms.
problem How small groups can influence machine learning algorithms deployed on digital platforms.
method Proposed a theoretical model and conducted experiments on a large-scale language model.
result Small groups can exert significant control over machine learning algorithms.
Survey of machine learning methods for Windows malware classification.
problem Difficulties in malware classification through data collection, labeling, feature creation, and selection.
method Review of current methods and challenges in malware classification.
result Discussion of constraints and unaddressed problems for machine learning in cybersecurity.
Modern computing and communication technologies can make data collection procedures very efficient. However, our ability to analyze large data sets and/or to extract information out from them is hard-pressed to keep up with our capacities for data collection. Among these huge data sets, some of them are not collected f…
This paper evaluates how different imputation methods affect predictive models.
problem The impact of different imputation methods on predictive models' performance.
method Systematic evaluation of various imputation methods for different data sets and machine learning algorithms.
result Recommendation of a general method for empirical benchmarking of imputation methods.
Proposes deep collective learning to learn inputs and weights together in neural networks.
problem The need to optimize inputs alongside weights in deep neural networks.
method Introduces deep collective learning to learn inputs and weights jointly, using lookup tables.
result Demonstrates advantages and promise of Lookup-VNets and deep collective learning.
The model interpretation is essential in many application scenarios and to build a classification model with a ease of model interpretation may provide useful information for further studies and improvement. It is common to encounter with a lengthy set of variables in modern data analysis, especially when data are coll…
Collective Learningcs.LG
Collective learning leverages human collaboration for semi-supervised learning.
problem Distributed semi-supervised learning with heterogeneous systems.
method Two phases: self-training and collective training with proxy-labels.
result Collective learning improves performance over individual learning.
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learningstat.ML
New guarantees for ERM with adaptively collected data.
problem Failure of ERM guarantees with adaptively collected data.
method Importance sampling weighted ERM algorithm with maximal inequality.
result First generalization guarantees and fast convergence rates for adaptively collected data.
In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, ignoring the correlation…
We give a generalization of toric symplectic geometry to Poisson manifolds which are symplectic away from a collection of hypersurfaces forming a normal crossing configuration. We introduce the tropical momentum map, which takes values in a generalization of affine space called a log affine manifold. Using this momentu…
We evaluated the effectiveness of an automated bird sound identification system in a situation that emulates a realistic, typical application. We trained classification algorithms on a crowd-sourced collection of bird audio recording data and restricted our training methods to be completely free of manual intervention.…
The thesis introduces methods to use semantic hierarchy in image classification.
problem Limited work in training image classifiers with non-conventional external guidance.
method Injects label hierarchy knowledge into arbitrary classifiers and uses order-preserving embeddings for image classification.
result Both embedding-based models and CNN-classifiers with hierarchical information outperform a hierarchy-agnostic model.
Mobile Traffic Classification through Physical Channel Fingerprinting: a Deep Learning Approacheess.SP
Deep learning classifies mobile traffic from LTE PDCCH.
problem Automatic classification of mobile applications and services.
method Convolutional Neural Network (CNN) trained on DCI messages.
result 99% accuracy in classifying traffic from LTE PDCCH.
TUDataset provides benchmark datasets for graph learning.
problem Lack of meaningful benchmark datasets and standardized evaluation procedures for graph learning.
method Collection and standardization of 120 graph datasets from various applications.
result Standardized evaluation procedures and baseline experiments provided.
Gradient boosting of regression trees is a competitive procedure for learning predictive models of continuous data that fits the data with an additive non-parametric model. The classic version of gradient boosting assumes that the data is independent and identically distributed. However, relational data with interdepen…
For every finite collection of curves on a surface, we define an associated (semi-)norm on the first homology group of the surface. The unit ball of the dual norm is the convex hull of its integer points. We give an interpretation of these points in terms of certain coorientations of the original collection of curves. …
Low-cost sensor fusion for organic substance classification.
problem Non-destructive classification and quality control of organic substances.
method Arduino Mega 2560 microcontroller with three sensors, supervised learning models, hyperparameter tuning, PCA/LDA, ensemble voting classifier.
result Test accuracies of 93-94% for identifying organic compounds.
Study shows noisy data collection in ImageNet leads to biased model performance.
problem Noisy data collection in ImageNet datasets causes biased model performance.
method Human studies on ImageNet dataset to investigate design choices and their impact.
result Systematic misalignment between ImageNet benchmark and real-world task.
Bayesian model predicts emotion from fitness tracker heartbeat data.
problem Predicting emotional valence from consumer fitness tracker heartbeat data.
method End-to-end Bayesian deep learning model using PPG data.
result Peak F1 score of 0.7 for emotional valence classification.
Face recognition system trained with noisy labels.
problem Label noise in training deep learning classifiers.
method Review and apply recent methods to manage noisy annotations.
result Improved performance of face recognition system with noisy labels.
New study shows limits to classifying brain activity from randomized EEG trials.
problem Classifying human brain activity from image stimuli using EEG is challenging.
method Used randomized trials on a larger dataset (20x) to avoid stimulus-time confound.
result Classification accuracy is marginally above chance and statistically significant.
Complete classification of knotoids up to seven crossings.
problem Classifying spherical knotoids up to a certain number of crossings.
method Enumerating diagrams, simplifying them, distinguishing equivalence classes using various invariants.
result Conjecture that classification up to seven crossings is complete.
Analysis of the phenomenon of speculative trading in one of its basic manifestations: postage stamp bubblescond-mat.stat-mech
We document and analyze the empirical facts concerning one of the clearest evidence of speculation in financial trading as observed in the postage collection stamp market. We unravel some of the mechanisms of speculative behavior which emphasize the role of fancy and collective behavior. In our conclusion, we propose a…
MPSA-DenseNet improves accent classification accuracy.
problem Accurate English accent identification.
method Combines multi-task learning and PSA attention mechanism with DenseNet.
result MPSA-DenseNet outperforms other models in accent classification.
Robotic clothing manipulation improved with fashion image analysis techniques.
problem Automated identification of clothing categories and landmarks for robotic tasks.
method Training data augmentation methods and rotation invariant convolutions.
result Our approach outperforms state-of-the-art models on unseen datasets.
New tool helps classify invariant subvarieties in degenerations.
problem Classifying invariant subvarieties in degenerations.
method Introducing diamonds of GL(2,R)-invariant subvarieties.
result Classified a rich collection of diamonds.
New method for robust learning from batches, even adversarial ones.
problem Learning from batches that may be corrupt or adversarial.
method General framework for robust learning, derived from optimal robust algorithms.
result First robust agnostic learning algorithms for various distributions.
Complete classification of rod complements in 3-torus using topology.
problem Classifying rod complements in the 3-torus.
method Topological arguments.
result Complete classification of all rod complements in the 3-torus.