Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering algorithm that extends mixture clustering in the presence of (i) soft constraints, and (ii) grouplevel constraints. Soft constraints can reflect the uncertainty associated with a priori knowledge about pairs of points th...

We introduce a method for learning pairwise interactions in a manner that satisfies strong hierarchy: whenever an interaction is estimated to be nonzero, both its associated main effects are also included in the model. We motivate our approach by modeling pairwise interactions for categorical variables with arbitrary numbers of levels, and then show how we can accommodate continuous variables a...

Security schemes of pairwise key establishment plays a fundamental role in research on security issue in wireless sensor networks. However, establishing pairwise keys in wireless sensor networks is not a trivial task, particularly due to the resource constraints on sensors. In this paper, we prose an efficient key distribution scheme, in which each sensor node randomly selects two key pools fro...

This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the bo...

Quasigroup completion is a recently proposed benchmark constraint satisfaction problem that combines the features of randomly generated instances and highly structured problems. A quasigroup completion problem can be represented as a CSP with n 2 variables, each with a domain of size n. The constraints can be represented either by 2n all diierent n-ary constraints or by binary pairwise constrai...

General equilibrium is investigated with N commodities deliverable at T dates traded spot and futures at 1⁄2 N 2T 3 dated commodity-pairwise trading posts. Trade is a resource-using activity recovering transaction costs through the spread between (bid) wholesale) and ask (retail) prices (pairwise rates of exchange). Budget constraints are enforced at each trading post separately implying demand...

where 1(·) is an indicator function and α is a trade-off coefficient between unary term and pairwise term. This coefficient α will be updated as stated in the following Sec. 2.2. Here we give the details on the computation of face pair relation v(xi,xj) ∈ V , which includes two steps: 1. Compute a normalized affinity matrix V a based on the distance between xi and xj . 2. Propagate the initial ...

Given two sequences S1, S2, and a constrained sequence C, a longest common subsequence of S1, S2 with restriction to C is called a constrained longest common subsequence of S1 and S2 with C. At the same time, an optimal alignment of S1, S2 with restriction to C is called a constrained pairwise sequence alignment of S1 and S2 with C. Previous algorithms have shown that the constrained longest co...

Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource constraints, is particularly challenging. This challenge has been met by the recent Reference-Broadcast Synchronization (RBS) proposal, which provides ondemand pairwise synchronization with low overhead and high precision...

We present a computational scheme to search for the most common motif, composed of a combination of sequence and structure constraints, among a collection of RNA sequences. The method uses a simplified version of the Sankoff algorithm for simultaneous folding and alignment of RNA sequences, but maintains tractability by constructing multi-sequence alignments from pairwise comparisons. The overa...