Real-world networks are often noisy, and the existing linkage structure may not be reliable. For example, a link which connects nodes from different communities may affect the group assignment of nodes in a negative way. In this paper, we study a new problem called link selection, which can be seen as the network equivalent of the traditional feature selection problem in machine learning. More ...

Developing feature selection algorithms that move beyond a pure correlational to a more causal analysis of observational data is an important problem in the sciences. Several algorithms attempt to do so by discovering the Markov blanket of a target, but they all contain a forward selection step which variables must pass in order to be included in the conditioning set. As a result, these algorit...

A confluent Vandermonde-like matrix P(a0, a, an) is a generalisation of the confluent Vandermonde matrix in which the monomials are replaced by arbitrary polynomials. For the case where the polynomials satisfy a three-term recurrence relation algorithms for solving the systems Px b and Pra f in O(n2) operations are derived. Forward and backward error analyses that provide bounds for the relativ...

The increasing interest in product networks (PNs) as a method of combining desirable properties of component networks, has prompted a need for the general study of the algorithmic issues related to this important class of interconnection networks. In this paper we present unified parallel algorithms for Gaussian elimination, with partial and complete pivoting, on product networks. A parallel al...

A confluent Vandermonde-like matrix P(a0, a, an) is a generalisation of the confluent Vandermonde matrix in which the monomials are replaced by arbitrary polynomials. For the case where the polynomials satisfy a three-term recurrence relation algorithms for solving the systems Px b and Pra f in O(n2) operations are derived. Forward and backward error analyses that provide bounds for the relativ...

Pathophysiology of hallucinations in Parkinson's disease is poorly understood. This study investigated relationships between visual hallucinations and visual acuity. Twenty-six consecutive patients with Parkinson's disease participated in this study. Patients were divided into two groups: patients with visual hallucinations (VH group) and those without visual hallucinations (no-VH group). Unaid...

Rough set is one of the most useful data mining techniques. How to use rough set to extract rule is the basement of rough set’s application. This paper discuss an algorithm that be used in attribute reduction. To attribute reduction, generally method is based on discernibility matrix or its improvement. But this series methods usually get one reduction, can’t accommodate uncertain information r...