511 research outputs found
Directional clustering through matrix factorization
This paper deals with a clustering problem where feature vectors are clustered depending on the angle between feature vectors, that is, feature vectors are grouped together if they point roughly in the same direction. This directional distance measure arises in several applications, including document classification and human brain imaging. Using ideas from the field of constrained low-rank matrix factorization and sparse approximation, a novel approach is presented that differs from classical clustering methods, such as seminonnegative matrix factorization, K-EVD, or k-means clustering, yet combines some aspects of all these. As in nonnegative matrix factorization and K-EVD, the matrix decomposition is iteratively refined to optimize a data fidelity term; however, no positivity constraint is enforced directly nor do we need to explicitly compute eigenvectors. As in k-means and K-EVD, each optimization step is followed by a hard cluster assignment. This leads to an efficient algorithm that is shown here to outperform common competitors in terms of clustering performance and/or computation speed. In addition to a detailed theoretical analysis of some of the algorithm's main properties, the approach is empirically evaluated on a range of toy problems, several standard text clustering data sets, and a high-dimensional problem in brain imaging, where functional magnetic resonance imaging data are used to partition the human cerebral cortex into distinct functional regions
Accelerated iterative hard thresholding
The iterativehardthresholding algorithm (IHT) is a powerful and versatile algorithm for compressed sensing and other sparse inverse problems. The standard IHT implementation faces several challenges when applied to practical problems. The step-size and sparsity parameters have to be chosen appropriately and, as IHT is based on a gradient descend strategy, convergence is only linear. Whilst the choice of the step-size can be done adaptively as suggested previously, this letter studies the use of acceleration methods to improve convergence speed. Based on recent suggestions in the literature, we show that a host of acceleration methods are also applicable to IHT. Importantly, we show that these modifications not only significantly increase the observed speed of the method, but also satisfy the same strong performance guarantees enjoyed by the original IHT method
Monadic second-order definable graph orderings
We study the question of whether, for a given class of finite graphs, one can
define, for each graph of the class, a linear ordering in monadic second-order
logic, possibly with the help of monadic parameters. We consider two variants
of monadic second-order logic: one where we can only quantify over sets of
vertices and one where we can also quantify over sets of edges. For several
special cases, we present combinatorial characterisations of when such a linear
ordering is definable. In some cases, for instance for graph classes that omit
a fixed graph as a minor, the presented conditions are necessary and
sufficient; in other cases, they are only necessary. Other graph classes we
consider include complete bipartite graphs, split graphs, chordal graphs, and
cographs. We prove that orderability is decidable for the so called
HR-equational classes of graphs, which are described by equation systems and
generalize the context-free languages
- …