Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
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...
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Wireless communication has attracted considerable interest in the research community, and many wireless networks are evaluated using discrete event simulators like OMNeT++. Althou...
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...