Paper extends cepstral distance for stable, minimum-phase models.
problem Quantifying similarity between data objects in deterministic systems.
method Combines insights from systems theory and machine learning to extend weighted cepstral distance.
result Extended weighted cepstral distance can be interpreted in terms of poles and zeros of the model.
Paper proposes a faster time series clustering method.
problem Efficiently clustering input/output time series with underlying dynamics.
method Extends Martin cepstral distance to efficiently cluster time series.
result New distance measure performs as well as explicit model identification but is much faster.
Detects AI-synthesized speech using cepstral and bispectral analysis.
problem Validating the authenticity of speech from AI-generated content.
method Integrates cepstral and bispectral analysis for distinguishing human from AI-synthesized speech.
result Higher-order statistics show less correlation for human speech compared to AI-synthesis, and cepstral analysis reveals unique power components.
CycleGAN-VC2 improves voice conversion without parallel data.
problem Challenges in non-parallel voice conversion.
method Improved CycleGAN-VC with three techniques: two-step adversarial losses, 2-1-2D CNN generator, and PatchGAN discriminator.
result CycleGAN-VC2 significantly reduces the gap between converted and target speech.
ResNet with Focal Loss improves speech emotion recognition.
problem Speech emotion recognition using plain text features is insufficient.
method Residual Convolutional Neural Network (ResNet) trained with Focal Loss.
result Focal Loss enhances model's focus on hard examples.
A new robust speaker identification method using minimum divergence measures.
problem Improving speaker identification accuracy in the presence of outliers.
method Minimum divergence approach with modified distance measures (likelihood disparity, Hellinger, Pearson's chi-square).
result Significant improvement in classification accuracy on benchmark and new speech corpora.
Paper optimizes KWS models using NAS and quantization for limited resources.
problem Developing efficient keyword spotting models in resource-constrained environments.
method Neural Architecture Search (NAS) for model structure optimization and quantization of weights and activations.
result Achieved high accuracy (95.55%) with minimal parameters and operations using NAS and quantization.
Machine learning classifies IoT noise in smart cities.
problem Noise classification in smart cities.
method Mel-frequency cepstral coefficients for audio features, supervised classification (SVM, k-NN), parameter optimization.
result Noise classification accuracy of 85% - 100%.
A novel weighted distance improves fuzzy c-means clustering accuracy.
problem Improving fuzzy c-means clustering performance with weighted distances.
method Proposed Canberra Weighted Distance to enhance FCM algorithm.
result Experimental results show superior performance of the proposed method.
Machine learning detects frog calls in audio recordings with high accuracy.
problem Estimating frog presence in audio recordings from tropical environments.
method Gaussian mixture model classification of frog calls with 20 cepstral features.
result The algorithm achieved an average weighted error rate of 0.9% for nine species classification.
New method calculates Ricci curvature from distances between weighted volumes.
problem Calculating Ricci curvature for weighted Riemannian manifolds.
method Asymptotic retrieval of generalized Ricci tensor from scaled metric derivatives of Wasserstein 1-distances.
result Limiting coarse curvature of random graphs converges to generalized Ricci tensor.
Unified framework evaluates different nearest neighbor classification methods.
problem Evaluating and comparing classical, fuzzy, and fuzzy rough nearest neighbor classification methods.
method Standardized nearest neighbor weighting with kernel functions applied to distance and/or rank values of nearest neighbors.
result NN, FNN, and FRNN perform best with Boscovich distance, and NN and FRNN perform best with specific combinations of weights and scaling measures.
A model classifies music genres from MP3 files using metric learning and feature extraction.
problem Classifying music genres from MP3 files efficiently and accurately.
method Metric learning and feature extraction using MFCC and PCA.
result Promising results in classification accuracy compared to baseline algorithms.
Authors disagree with recent findings on random Gaussian weights in DNNs.
problem The relationship between angle and distance shrinkage in DNNs with random Gaussian weights is incorrect.
method Comparison of recent findings with new observations on random Gaussian weights in DNNs.
result Theorem 3 and Figure 5 in the recent paper are not accurate.
NLDD predicts labelsets minimizing weighted distances in feature and label spaces.
problem Predicting labels independently ignores label correlations.
method NLDD minimizes a weighted sum of distances in feature and label spaces.
result NLDD outperforms other methods in multi-label classification metrics.
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges …
Detects adversarial examples in deep speech recognition.
problem Vulnerability of deep speech recognition systems to adversarial attacks.
method Formulated as a classification problem, generated adversarial and normal datasets, trained CNN.
result Accurately distinguishes between adversarial and normal examples for known attacks.
Power weighted shortest paths improve clustering of high-dimensional data.
problem Clustering high-dimensional Euclidean data with disjoint low-dimensional manifolds.
method Use of power weighted shortest path distance functions and a fast algorithm.
result Higher clustering accuracy achieved through power weighted shortest paths.
New fuzzy clustering method for distribution-valued data using adaptive Wasserstein distances.
problem Clustering distribution-valued data with adaptive weights.
method Fuzzy c-means algorithms using adaptive L2 Wasserstein distances. result Adaptive distances improve clustering of distribution-valued data.
Fundamental weight systems identified as quantum states.
problem Identifying which weight systems are quantum states.
method Analyzing the Cayley distance kernel on the symmetric group and its positivity.
result All fundamental gl(n)-weight systems are quantum states.
WE constructs GP kernels for mixed inputs using weighted EDMs.
problem Limitation of standard GP models in handling categorical variables.
method WEGP constructs kernel function using weighted EDMs for categorical inputs.
result WEGP improves GP model accuracy in both synthetic and real-world optimization problems.
Model classifies environment sounds using multiple feature channels and attention mechanisms.
problem Environment sound classification task.
method Multiple feature channels (MFCC, GFCC, CQT, Chromagram) and attention mechanism in a deep CNN.
result Achieves state-of-the-art performance on three benchmark datasets.
The paper compares isoperimetric quotients and capacities in weighted manifolds.
problem Comparing isoperimetric quotients and capacities in weighted manifolds.
method Analysis of weighted Laplacian of the distance function and techniques for non-compact submanifolds.
result Parabolicity and hyperbolicity criteria for weighted manifolds.
DW-KNN improves KNN by integrating distance and neighbor reliability for better prediction accuracy.
problem Standard KNN assumes all neighbors are equally reliable, leading to unreliable predictions in heterogeneous feature spaces.
method DW-KNN integrates exponential distance with neighbor validity, providing instance-level interpretability and reducing hyperparameter sensitivity.
result DW-KNN achieves 0.8988 average accuracy, ranks 2nd among six methods, and has the lowest cross-validation variance.
Improved cross-lingual document retrieval using regularized Wasserstein distance.
problem Cross-lingual document retrieval (CLDR) challenges.
method Extending Word Mover's Distance with term-weighting schemes and entropic regularization.
result Remarkable improvements in Mean Reciprocal Rank (MRR) compared to baselines.
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
The paper studies curvature bounds for manifolds with density.
problem Curvature bounds for Riemannian manifolds with density.
method Develops new tools for studying weighted sectional curvature bounds, including a weighted Rauch comparison theorem and a modified convexity notion.
result Improves results for spaces of positive weighted sectional curvature and symmetry.
A new metric learning algorithm using Deep Forest for better class separability.
problem Improving distance metrics between similar and different classes.
method Discriminative Deep Forest (DisDF) algorithm with weighted decision trees.
result The algorithm reduces distances within the same class and increases between different classes.
TAWT improves cross-task learning efficiency and guarantees.
problem Improving cross-task learning efficiency and theoretical understanding.
method Target-Aware Weighted Training (TAWT) minimizing representation-based task distance.
result TAWT achieves non-asymptotic learning-theoretic guarantees and is effective in NLP tasks.
Study shows challenges in converting RNNs to FSMs due to computational complexity.
problem Understanding the equivalence and distance between RNNs and FSMs.
method Computational proofs for equivalence and distance problems between RNNs and FSMs.
result Undecidability and hardness of approximation problems between RNNs and FSMs.
Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
SDF improves Siamese neural networks using deep forest.
problem Overfitting in neural networks with limited data.
method Modified training set with concatenated pairs, weighted class distributions, quadratic optimization.
result Reduces distances between similar pairs and increases between dissimilar points.
Paper defines a new distance metric for comparing learning tasks.
problem Comparing difficulty of learning tasks between source and target.
method Information geometry, optimal transport, coupled transfer distance.
result Coupled transfer distance correlates with fine-tuning difficulty.
Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but injective exponential maps. A generalization of the thickness formula is obtaine…
Layer rotation predicts model generalization, improving test accuracy by up to 30%.
problem Predicting model generalization in deep networks.
method Monitoring the cosine distance between layer weights and their initial values during training.
result Training procedures that maximize layer rotation consistently lead to better generalization performance.
Improves molecular activity prediction using graph convolutional neural networks considering graph distances.
problem Predicting molecular activity using graph convolutional neural networks with improved distance representation.
method Proposed three improvements: modified graph distances, distance-dependent weight matrices, and weighted sum conversion.
result The proposed method slightly outperforms the original weave module in compound activity prediction.
A new method detects small holes in noisy data.
problem Detecting small holes in high-density regions from noise.
method Robust Density-Aware Distance (RDAD) filtration, incorporating distance-to-measure concept.
result The RDAD filtration prolongs the persistences of small holes, making them distinguishable from noise.
This paper approximates 1-Wasserstein distance using tree-based embedding.
problem Computational inefficiency of estimating 1-Wasserstein distance.
method L1-regularized approach to learn tree weights, using shortest path distance as a linear model.
result Tree-Wasserstein distance (TWD) approximates 1-Wasserstein distance efficiently.
This paper refines MMD for domain adaptation by balancing intra-class and inter-class distances.
problem Balancing intra-class and inter-class distances for better feature discriminability in domain adaptation.
method The paper theoretically proves two facts about MMD and proposes a novel discriminative MMD method to balance intra-class and inter-class distances.
result The proposed method improves feature discriminability and outperforms state-of-the-art methods.
This paper proposes a new method for feature scaling in K-Nearest Neighbors.
problem Feature scaling issues in K-Nearest Neighbors algorithm.
method Assign weights to individual features using out-of-bag errors from decision tree models.
result Improves prediction accuracy by assigning weights to features based on out-of-bag errors.
GLIS uses IDW and RBF for efficient global optimization.
problem Expensive objective function in optimization problems.
method Combines inverse distance weighting and radial basis functions for acquisition function.
result Competitive and computationally lighter than Bayesian optimization.
Study of metrics on positive-definite matrices from power potential, linking to power means.
problem Understanding metrics on positive-definite matrices derived from power potential.
method Explicit expressions for geodesics and distance function derived from Hessian of power potential.
result Geodesics and distance function converge to weighted matrix geometric mean as β tends to zero.
A new kNN imputation method improves classification performance on datasets with missing data.
problem Missing data in classification problems.
method Class weighted grey distance with MI weighting for kNN imputation.
result Improved classification performance compared to existing methods.
A novel approach selects EEGs for better brain disease diagnosis.
problem Invalid/noisy EEGs degrade diagnosis performance.
method mwcEEGs: maximum weight clique-based approach.
result Improves classification performance by selecting intra-clique and inter-clique EEGs.
A method for clustering high-dimensional data using probabilistic ℓ1-metric.
problem Clustering high-dimensional data with unreliable distances.
method Iterative method using ℓ1-metric to find weighted medians. result Algorithm's performance improves with increasing dimensionality.
Human cochlear models improve DNN noise suppression systems.
problem DNN-based noise suppression systems lack robustness to unseen noise conditions.
method Coupled cochlear models with DNNs to improve noise suppression.
result Cochlear models enhance DNN generalizability to various noise conditions.
SWRLDA improves LDA for multi-class classification with edge classes.
problem LDA's vulnerability to edge classes causing biased mean and large distances.
method Self-weighted robust LDA with l21-norm distance criterion.
result SWRLDA outperforms other methods on synthetic and real-world datasets.
WIPS optimizes inner product weights to approximate various similarities.
problem Learning high-quality node representations and accurate similarities.
method Weighted inner product similarity (WIPS) with adjustable weights.
result WIPS can approximate arbitrary general similarities including positive definite and indefinite kernels.