Search

In this work, with the help of a calculus system syllogistic logic with Carroll's diagrams (SLCD), we construct a useful algorithm for the possible deductions of polysyllogisms (soriteses). This algorithm makes a general deduction in categorical syllogisms with the help of diagrams to depict each proposition of polysyllogisms. The developed calculus system PolySLCD (PSLCD) is used to allow a formal deduction from premises set by comprising synchronically biliteral and triliteral diagrammatical appearance and simple algorithmic nature. This algorithm can be used to deduce new conclusions, step by step, through recursive conclusion sets that are obtained from premises of categorical polysyllogisms. The fundamental contributions of this paper are accurately deducing conclusions from sets corresponding to given premises as exact human reasoning using a single algorithm and designing this algorithm based on SLCD. Therefore, it is more suitable for computer-aided solution. Since the algorithm is set-based, it is a novel algorithm in the literature and it can easily contribute to the researchers using polysyllogisms in different scientific branches, such as computer science, decision-making systems and artificial intelligence. [ABSTRACT FROM AUTHOR]

Link prediction in heterogeneous networks aims at predicting missing interactions between pairs of nodes with the help of the topology of the target network and interconnected auxiliary networks. It has attracted considerable attentions from both computer science and bioinformatics communities in the recent years. In this paper, we introduce a novel Collaborative Linear Manifold Learning (CLML) algorithm. It can optimize the consistency of nodes similarities by collaboratively using the manifolds embedded between the target network and the auxiliary network. The experiments on four benchmark datasets have demonstrated the outstanding advantages of CLML, not only in the high prediction performance compared to baseline methods, but also in the capability to predict the unknown interactions in the target networks accurately and effectively. [ABSTRACT FROM AUTHOR]

Facing the massive amount of data appearing on the web, automatic analysis tools have become essential for web users to discover valuable information online. Precise similarity measurement plays a decisive role in enabling analysis tools to acquire high-quality performances. Because different features contribute diversely to similarity calculation, it is necessary to utilize weight to measure feature's contribution and import it into similarity measurement. To accurately assign feature's weight, constrained data-pairs provided by users are usually imported into the weight evaluation procedure, whereas conventional plans all fail to consider two challenges: (a) asymmetrical distribution of constrained data-pairs, and (b) inconsistency contained by constrained data-pairs. If these two issues occur, conventional plans are incompetent at addressing them or are even unable to work. Thus, this paper proposes a novel constraint based weight evaluation to address these two issues. For the former, constrained data-pairs are partitioned into several equivalent classes, and distributing parameters are assigned to constrained data-pairs to balance their distributions. For the latter, constrained data-pairs are connected one after another, and belief values are thereby formed to indicate their probability of being inconsistent. Experimental results demonstrate that this type of evaluation is independent of any algorithm. With this evaluation, similarities can be calculated more accurately. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we study a problem that arises in the competitive facility location field. Facilities and customers are represented by points of a planar Euclidean domain. We associate a weighted distance to each facility to reflect that customers select facilities depending on distance and importance. We define, by considering weighted distances, the k-influence region of a facility as the set of points of the domain that has the given facility among their k-nearest/farthest neighbors. On the other hand, we partition the domain into subregions so that each subregion has a non-negative weight associated to it which measures a characteristic related to the area of the subregion. Given a weighted partition of the domain, the k-influence region problem finds the points of the domain where are new facility should be opened. This is done considering the known weight associated to the new facility and ensuring a minimum weighted area of its k-influence region. We present a GPU parallel approach, designed under CUDA architecture, for approximately solving the k-influence region problem. In addition, we describe how to visualize the solutions, which improves the understanding of the problem and reveals complicated structures that would be hard to capture otherwise. Integration of computation and visualization facilitates decision makers with an iterative what-if analysis process, to acquire more information to obtain an approximate optimal location. Finally, we provide and discuss experimental results showing the efficiency and scalability of our approach. [Copyright &y& Elsevier]