Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...
Abstract— An efficient algorithm for three-dimensional (3D) capacitance extraction on multi-layered and lossy substrate is presented. The new algorithm represents a major improv...
This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is...
Andrei Petrovski, Alexander E. I. Brownlee, John A...
With the aim to deal with sentiment-transfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graph-ranking algorithm. We a...