5 papers
On the Vertices That Belong to All Minimum Identifying Codes
Ville Junnila, Tero Laihonen, Havu Miikonen
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in eve…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
Ville Junnila, Tero Laihonen, Havu Miikonen
Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minim…
A Link between Coding Theory and Cross-Validation with Applications
Tapio Pahikkala, Parisa Movahedi, Ileana Montoya +4
How many different binary classification problems a single learning algorithm can solve on a fixed data with exactly zero or at most a given number of cross-validation errors? Whil…
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
Mélanie Cambus, Davin Choo, Havu Miikonen +1
Identifying clusters of similar elements in a set is a common task in data analysis. With the immense growth of data and physical limitations on single processor speed, it is neces…