4 papers
Efficient Search in Graph Edit Distance: Metric Search Trees vs. Brute Force Verification
Wenqi Marshall Guo, Jeffrey Uhlmann
This report evaluates the efficiency of Graph Edit Distance (GED) computation for graph similarity search, comparing Cascading Metric Trees (CMT) with brute-force verification. Des…
Rank-Preference Consistency as the Appropriate Metric for Recommender Systems
Tung Nguyen, Jeffrey Uhlmann
In this paper we argue that conventional unitary-invariant measures of recommender system (RS) performance based on measuring differences between predicted ratings and actual user…
Optimal Structured Matrix Approximation for Robustness to Incomplete Biosequence Data
Chris Salahub, Jeffrey Uhlmann
We propose a general method for optimally approximating an arbitrary matrix by a structured matrix (circulant, Toeplitz/Hankel, etc.) and examine its use…
Partial Proof of a Conjecture with Implications for Spectral Majorization
Jeffrey Uhlmann
In this paper we report on new results relating to a conjecture regarding properties of , , positive definite matrices. The conjecture has been proven for $n\le…