Search Results for author:
Found 4 papers, 1 papers with code
Beam Search for Feature Selection
In this paper, we present and prove some consistency results about the performance of classification models using a subset of features.
Classification with Nearest Disjoint Centroids
In this paper, we develop a new classification method based on nearest centroid, and it is called the nearest disjoint centroid classifier.
Biclustering with Alternating K-Means
Biclustering is the task of simultaneously clustering the rows and columns of the data matrix into different subgroups such that the rows and columns within a subgroup exhibit similar patterns.
A metric on directed graphs and Markov chains based on hitting probabilities
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
