New stability measures for similar features improve feature selection accuracy.
problem Existing stability measures fail to distinguish similar features in highly correlated datasets.
method Introduce new adjusted stability measures that consider feature similarities.
result One new stability measure considers highly similar features as interchangeable.
Proposes a new stability measure for model fitting on similar feature data sets.
problem Model fitting on data sets with similar features is challenging.
method Tuning hyperparameters in a multi-criteria fashion with predictive accuracy and feature selection stability.
result Our approach achieves similar or better predictive performance than single-criteria and stability selection approaches.
Paper improves image retrieval quality using nonlinear rank approximations.
problem Improving image retrieval quality in high-dimensional feature spaces.
method Computes normalized approximated ranks, converts to similarities, and uses them in a new loss function.
result Significant improvement in image retrieval quality on multiple datasets.
BiLRP explains deep similarity models by decomposing scores into feature contributions.
problem Verifying meaningful patterns in complex similarity models.
method Augmenting similarity scores with feature explanations using LRP.
result BiLRP robustly explains deep neural network features and historical document similarities.
Enhances graph neural networks by considering feature similarities in node aggregation.
problem Ignoring node feature similarities in traditional graph aggregation schemes.
method Interprets node aggregation as kernel weighting, proposing a framework that considers feature similarities.
result Proposed framework outperforms traditional GCNs in real-world applications.
FBSM improves item recommendation for cold-start users by modeling feature interactions.
problem Cold-start item recommendation for new users.
method Factorized bilinear similarity model learning interactions among item features.
result Improves TOP-n recommendation performance compared to traditional methods.
Deep learning features improve CBIR system performance.
problem Retrieving similar images from a large database.
method Using features from pre-trained deep learning models for similarity retrieval.
result Significantly superior retrieval results compared to traditional methods.
Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…
FUJI scores similarity of ranked lists more robustly.
problem Improving similarity assessment of ranked lists.
method Integrates a membership function into Jaccard index for better rank consideration.
result More stable and accurate similarity estimates.
PML-LFC improves PML by estimating label confidence from both feature and label spaces.
problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.
Proposes SimPool for graph pooling using structural similarity features.
problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.
A novel unsupervised feature selection method using subspace clustering and self-expressive model.
problem Feature selection for large datasets with minimal labeling effort.
method Subspace clustering with adaptive representation learning and regularized regression.
result The method effectively captures sample similarities and discriminative information.
Study shows how task similarity affects forgetting in teacher-student setup.
problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.
GAN normalizes CT scans for consistent radiomic feature values.
problem Variations in dose levels and slice thickness affect radiomic features sensitivity.
method Used a 3D generative adversarial network (GAN) to normalize reduced dose, thick slice images to normal dose, thinner slice images.
result GAN-based approach led to significantly smaller error in radiomic features.
The Hirzebruch χy-genus and Poincare polynomial share some similar features. In this article we investigate two of their similar features simultaneously. Through this process we shall derive several new results as well as reprove and improve some known results.
A good measure of similarity between data points is crucial to many tasks in machine learning. Similarity and metric learning methods learn such measures automatically from data, but they do not scale well respect to the dimensionality of the data. In this paper, we propose a method that can learn efficiently similarit…
Novel channel pruning method accelerates deep CNNs by removing redundant, similar features.
problem Limitations of existing magnitude-based pruning algorithms in similar magnitude cases.
method Hierarchical clustering of channels based on probabilistic similarity metrics, without sparsity training.
result 30% reduction in FLOPs for pruned ResNet-50 on ImageNet, outperforming baseline.
Drug similarity has been studied to support downstream clinical tasks such as inferring novel properties of drugs (e.g. side effects, indications, interactions) from known properties. The growing availability of new types of drug features brings the opportunity of learning a more comprehensive and accurate drug similar…
Optimized fuzzy entropy framework improves feature selection and classification performance.
problem Improving feature selection and classification in fuzzy entropy frameworks.
method Implemented and compared combinations of ideal vectors, maximal similarity classifiers, and fuzzy entropy functions.
result Optimized combination of ideal vector, similarity classifier, and fuzzy entropy function achieved the most stable performance for all three datasets.
Production recommendation systems rely on embedding methods to represent various features. An impeding challenge in practice is that the large embedding matrix incurs substantial memory footprint in serving as the number of features grows over time. We propose a similarity-aware embedding matrix compression method call…
A method for clustering using transfer learning from similar labeled data.
problem Clustering with datasets having different features and labeled data.
method Constructing meta-features to describe structural characteristics of data and transferring them between source and target domains.
result The method is efficient and works under arbitrary feature descriptions of source and target domains with smaller complexity.
Music genre classification is an essential tool for music information retrieval systems and it has been finding critical applications in various media platforms. Two important problems of the automatic music genre classification are feature extraction and classifier design. This paper investigates inter-genre similarit…
Quantum networks learn task-dependent asymmetric similarity measures.
problem Challenges of conventional distance functions in capturing meaningful similarity.
method GQSim: Quantum networks for learning task-dependent (a)symmetric similarity.
result Quantum similarity measures extract salient features and achieve theoretically guaranteed performance.
A new method selects the best feature selection technique for datasets.
problem Selecting the best feature selection method for unseen datasets.
method Data synthesis, meta features, fuzzy similarity, classification model training.
result Successfully recommended the best feature selection method for five out of eight datasets.
Multitask learning can be effective when features useful in one task are also useful for other tasks, and the group lasso is a standard method for selecting a common subset of features. In this paper, we are interested in a less restrictive form of multitask learning, wherein (1) the available features can be organized…
Similarity metrics are a core component of many information retrieval and machine learning systems. In this work we propose a method capable of learning a similarity metric from data equipped with a binary relation. By considering only the similarity constraints, and initially ignoring the features, we are able to lear…
Proposes a method to compare neural networks using feature and gradient vectors.
problem Understanding the behavior of neural networks trained on different datasets.
method Defines a similarity index using feature and gradient vectors, and employs sketching techniques for efficient comparison.
result Demonstrates superior performance in computing similarity of neural networks trained on different datasets.
Study how models represent features in naturalistic learning problems.
problem Understanding which features models use and ignore in naturalistic tasks.
method Synthetic datasets with controlled task-relevance of features, training models to recognize both easy and hard features.
result Models preferentially represent task-relevant features and suppress task-irrelevant ones over training.
We propose Deep Feature Factorization (DFF), a method capable of localizing similar semantic concepts within an image or a set of images. We use DFF to gain insight into a deep convolutional neural network's learned features, where we detect hierarchical cluster structures in feature space. This is visualized as heat m…
We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a von Mises-Fisher distribution, an exponential family distribution on the surface …
Paper proposes a new method for joint feature selection and graph learning.
problem Previous methods suffer from neglecting joint formulation and lack of graph learning.
method Formulates multi-view feature selection with orthogonal decomposition, incorporates cross-space locality preservation, and uses a unified objective function for simultaneous learning.
result Demonstrates superior performance in multi-view feature selection and graph learning tasks.
We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a variational autoencoder with a generative adversarial network we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective. Thereby, we repla…
Similarity and metric learning provides a principled approach to construct a task-specific similarity from weakly supervised data. However, these methods are subject to the curse of dimensionality: as the number of features grows large, poor generalization is to be expected and training becomes intractable due to high …
In this paper, we propose a method for image-set classification based on convex cone models, focusing on the effectiveness of convolutional neural network (CNN) features as inputs. CNN features have non-negative values when using the rectified linear unit as an activation function. This naturally leads us to model a se…
Rewiring GNNs to optimize community and feature alignment improves their performance.
problem Improving GNNs' performance by addressing over-squashing and generalization issues.
method Three rewiring strategies: ComMa, FeaSt, and ComFy, targeting community structure, node labels, and their alignment.
result Rewiring strategies enhance GNNs' performance by optimizing label-community alignment.
Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…
CLS measures dataset similarity through decision rule performance.
problem Measuring dataset similarity in machine learning, especially for transfer learning and domain adaptation.
method Cross-Learning Score (CLS) measures similarity through bidirectional generalization performance of decision rules, linking to cosine similarity under canonical linear models.
result CLS effectively measures dataset similarity and transferability, validated on synthetic and real-world datasets.
Graph network predicts circRNA-disease associations using multi-source similarity features.
problem Identifying circRNA-disease associations is challenging and time-consuming.
method Proposes a graph convolution network framework using multi-source similarity information.
result Framework predicts circRNA-disease associations with promising results and outperforms existing methods.
A new method for feature selection in high-dimensional data.
problem Dealing with noise and high-dimensional data in unsupervised feature selection.
method Sparse PCA via l2,p-norm regularization, combined with an efficient optimization algorithm. result The proposed method effectively selects features from real-world data sets.
Spectral clustering is one of the most effective clustering approaches that capture hidden cluster structures in the data. However, it does not scale well to large-scale problems due to its quadratic complexity in constructing similarity graphs and computing subsequent eigendecomposition. Although a number of methods h…
Neural networks are capable of learning rich, nonlinear feature representations shown to be beneficial in many predictive tasks. In this work, we use such models to explore different geographical feature representations in the context of predicting colorectal cancer survival curves for patients in the state of Iowa, sp…
This work improves transferability by considering conditional distributions in feature representations.
problem Improving transferability across multiple domains by considering conditional distributions.
method Introducing von Neumann conditional divergence to quantify the functional dependence between features and desired response.
result Favorable performance in terms of smaller generalization error and less catastrophic forgetting.
DiSC detects feature clusters that differentiate between conditions.
problem Identifying subsets of features that differentiate between two conditions.
method Construct feature graphs, compute connectivity differences using spectral clustering.
result DiSC uncovers features that better differentiate between conditions.
Improves document summarization by combining word embeddings and n-grams.
problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.
Dynamic time warping (DTW) can be used to compute the similarity between two sequences of generally differing length. We propose a modification to DTW that performs individual and independent pairwise alignment of feature trajectories. The modified technique, termed feature trajectory dynamic time warping (FTDTW), is a…
The paper proposes tree-based methods for automatically learning similarity measures.
problem Automatically learning similarity measures in feature spaces.
method Formulates similarity learning as a pairwise bipartite ranking problem and uses recursive tree-based ROC optimization.
result Validates iterative partitioning procedures for similarity learning and proposes efficient algorithms.
New insights into continual learning with task similarity.
problem Challenges in learning similar tasks without interference.
method Linear teacher-student model with latent structure.
result High input feature similarity with low readout similarity is catastrophic.
A new model SEQ clusters and classifies encoded features for better interpretability.
problem Lack of interpretability in classical supervised classification tasks.
method Proposes a novel supervised learning model named Supervised-Encoding Quantizer (SEQ) that applies a quantizer to cluster and classify encoded features.
result The quantizer provides an interpretable graph where each cluster represents a class with a particular style.