Exhaustive k-nearest-neighbour subspace clustering

Cluster analysis is an important technique of explorative data mining. It refers to a collection of statistical methods for learning the structure of data by solely exploring pairwise distances or similarities. Often meaningful structures are not detectable in these high-dimensional feature spaces. Relevant features can be obfuscated by noise from irrelevant measurements. These observations led to the design of subspace clustering algorithms, which can identify clusters that originate from different subsets of features. Hunting for clusters in arbitrary subspaces is intractable due to the infinite search space spanned by all feature combinations. In this work, we present a subspace clustering algorithm that can be applied for exhaustively screening all feature combinations of small- or medium-sized datasets (approximately 30 features). Based on a robustness analysis via subsampling we are able to identify a set of stable candidate subspace cluster solutions.     

Editorial

No abstract available for this article.     

Der Spagat zwischen Ehrenamt und Dienstleistung

The already existing social political debate about a new culture of citizenship engagement has reached the internal live of traditional independent social care associations. Their specificity is, among others, that, they are not only voluntary organisations based on moral values, but also that they have developed into services companies with a staff of over one million regular employees.     

Bayesian regularisation in structured additive regression: a unifying perspective on shrinkage, smoothing and predictor selection

This paper surveys various shrinkage, smoothing and selection priors from a unifying perspective and shows how to combine them for Bayesian regularisation in the general class of structured additive regression models. As a common feature, all regularisation priors are conditionally Gaussian, given further parameters regularising model complexity. Hyperpriors for these parameters encourage shrinkage, smoothness or selection. It is shown that these regularisation (log-) priors can be interpreted as Bayesian analogues of several well-known frequentist penalty terms. Inference can be carried out with unified and computationally efficient MCMC schemes, estimating regularised regression coefficients and basis function coefficients simultaneously with complexity parameters and measuring uncertainty via corresponding marginal posteriors. For variable and function selection we discuss several variants of spike and slab priors which can also be cast into the framework of conditionally Gaussian priors. The performance of the Bayesian regularisation approaches is demonstrated in a hazard regression model and a high-dimensional geoadditive regression model.     

How Does Borderline Personality Disorder Affect Parental Care?

This article seeks to find arguments based on research for the possibility of dealing with borderline personality disorders (BPDs). This is illustrated by the frequency with which children are removed from parents who have been given the diagnosis of BPD. The author favors the view that there are degrees of BPD. As a result, it is felt that psychological treatment can do much to reverse the symptoms of BPD, in many cases, if not all. Following the delineating of the research, the author presents strategies and procedures that seek to counteract the symptoms of BPD and when possible the eventual reinstatement of children with the parent.     

Eine bemerkung zur stetigkeit zufälliger felder

In the paper a sequence of bounded regions containing n independent identically and uniformly on D_n distributed points is considered. It is assumed that the d–dimensional volume v(D_n) is asymptotically proportional to n. Under these conditions it is shown that the number of pairs of points within a distance r>0 of each other is asymptotically normally distributed. For proving this among other things a lemma of BOLTHAUSEN is used, whereas even strong estimates for U–statistics are insufficient. The obtained result is applied for testing the hypothesis of randomness