In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
Alexandre V. Evfimievski, Ramakrishnan Srikant, Ra...
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
Alexandru Caracas, Andreas Kind, Dieter Gantenbein...
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...