This paper explores the possibility of using multiplicative random projection matrices for
privacy preserving distributed data mining. It specifically considers the problem of computing …

In this letter, we solve the problem of identifying matrices S/spl isin//spl Ropf//sup n/spl
times/N/and A/spl isin//spl Ropf//sup m/spl times/n/knowing only their multiplication X= AS …

A Compound fault signal usually contains multiple characteristic signals and strong
confusion noise, which makes it difficult to separate week fault signals from them through …

We address the problem of underdetermined BSS. While most previous approaches are
designed for instantaneous mixtures, we propose a time-frequency-domain algorithm for …

In many practical problems for data mining the data X under consideration (given as (m× N)-
matrix) is of the form X= AS, where the matrices A and S with dimensions m× n and n× N …

We formulate conditions (k-SCA-conditions) under which we can represent a given (m/spl
times/N)-matrix, X,(data set) uniquely (up to scaling and permutation) as a multiplication of …

We propose a new framework, called piecewise linear separation, for blind source
separation of possibly degenerate mixtures, including the extreme case of a single mixture …

The problem of blind source separation (BSS) is investigated. Following the assumption that
the time-frequency (TF) distributions of the input sources do not overlap, quadratic TF …

In this paper we address the problem of overcomplete BSS for convolutive mixtures
following a two-step approach. In the first step the mixing matrix is estimated, which is then …

Recently, wireless ad-hoc sensor networks due to their abilities are being rapidly developed
to collect data across the area of deployment. To describe the collected data and facilitate …