As more and more information is available in the Electronic Health Record in the form of free-text narrative, there is a need for automated tools, which can process and understand...
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
Comparisons made in two studies of 21 methods for finding prototypes upon which to base the nearest prototype classifier are discussed. The criteria used to compare the methods are...
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...