Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...
Abstract. We present a method that improves the results of network intrusion detection by integration of several anomaly detection algorithms through trust and reputation models. O...
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...