http://eprints.fri.uni-lj.si/994/1/2008-IJMI-BellazziZupan.pdf

Predictive data mining in clinical medicine: Current issues and guidelines

Will Tracz, our esteemed editor and Used-Program salesman, has written an entertaining, non-technical book dealing with the practice (and lack of) of software reuse. Its a collection of essays, mostly rehashed (reused?) and updated from various columns and papers published over the years.. Its a short (a bit over 200 pages) easy reading and enjoyable book (I read most of it in one sitting). Some of the essays discuss what was printed in the past and a discussion of the current status of the points.

Safeware: System Safety and Computers

We propose a theoretically and practically improved density-based, hierarchical clustering method, providing a clustering hierarchy from which a simplified tree of significant clusters can be constructed. For obtaining a “flat” partition consisting of only the most significant clusters (possibly corresponding to different density thresholds), we propose a novel cluster stability measure, formalize the problem of maximizing the overall stability of selected clusters, and formulate an algorithm that computes an optimal solution to this problem. We demonstrate that our approach outperforms the current, state-of-the-art, density-based clustering methods on a wide variety of real world data.

Density-based clustering based on hierarchical density estimates

There have been many proposals for first-order belief networks (i.e., where we quantify over individuals) but these typically only let us reason about the individuals that we know about. There are many instances where we have to quantify over all of the individuals in a population. When we do this the population size often matters and we need to reason about all of the members of the population (but not necessarily individually). This paper presents an algorithm to reason about multiple individuals, where we may know particular facts about some of them, but want to treat the others as a group. Combining unification with variable elimination lets us reason about classes of individuals without needing to ground out the theory.

/pdf/first-order-probabilistic-inference-41ibm0jiyt.pdf

First-order probabilistic inference

A discrete-time Bayesian network reliability modeling and analysis framework

Diez's algorithm for the noisy MAX is very efficient for polytrees, but when the network has loops, it has to be combined with local conditioning, a suboptimal propagation algorithm. Other algorithms, based on several factorizations of the conditional probability of the noisy MAX, are not as efficient for polytrees but can be combined with general propagation algorithms such as clustering or variable elimination, which are more efficient for networks with loops. In this article we propose a new factorization of the noisy MAX that amounts to Diez's algorithm in the case of polytrees and at the same time is more efficient than previous factorizations when combined with either variable elimination or clustering.

Severino F. Galán

Papers

Efficient computation for the noisy MAX

NasoNet, modeling the spread of nasopharyngeal cancer with networks of probabilistic events in discrete time

Networks of probabilistic events in discrete time

Comparative evaluation of region query strategies for DBSCAN clustering

Incorporating organizational factors into probabilistic safety assessment of nuclear power plants through canonical probabilistic models