Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...