1,031 research outputs found
Efficient Computation of Multiple Density-Based Clustering Hierarchies
HDBSCAN*, a state-of-the-art density-based hierarchical clustering method,
produces a hierarchical organization of clusters in a dataset w.r.t. a
parameter mpts. While the performance of HDBSCAN* is robust w.r.t. mpts in the
sense that a small change in mpts typically leads to only a small or no change
in the clustering structure, choosing a "good" mpts value can be challenging:
depending on the data distribution, a high or low value for mpts may be more
appropriate, and certain data clusters may reveal themselves at different
values of mpts. To explore results for a range of mpts values, however, one has
to run HDBSCAN* for each value in the range independently, which is
computationally inefficient. In this paper, we propose an efficient approach to
compute all HDBSCAN* hierarchies for a range of mpts values by replacing the
graph used by HDBSCAN* with a much smaller graph that is guaranteed to contain
the required information. An extensive experimental evaluation shows that with
our approach one can obtain over one hundred hierarchies for the computational
cost equivalent to running HDBSCAN* about 2 times.Comment: A short version of this paper appears at IEEE ICDM 2017. Corrected
typos. Revised abstrac
A Flexible Implementation of a Matrix Laurent Series-Based 16-Point Fast Fourier and Hartley Transforms
This paper describes a flexible architecture for implementing a new fast
computation of the discrete Fourier and Hartley transforms, which is based on a
matrix Laurent series. The device calculates the transforms based on a single
bit selection operator. The hardware structure and synthesis are presented,
which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E
device.Comment: 4 pages, 4 figures. IEEE VI Southern Programmable Logic Conference
201
Algebraic lattices achieve the capacity of the ergodic fading channel
In this work we show that algebraic lattices con- structed from error-correcting codes achieve the ergodic capacity of the fading channel. The main ingredients for our construction are a generalized version of the Minkowski-Hlawka theorem and shaping techniques based on the lattice Gaussian distribution. The structure of the ring of integers in a number field plays an important role in the proposed construction. In the case of independent and identically distributed fadings, the lattices considered exhibit full diversity and an exponential decay of the probability of error with respect to the blocklength
Fourier Eigenfunctions, Uncertainty Gabor Principle and Isoresolution Wavelets
Shape-invariant signals under Fourier transform are investigated leading to a
class of eigenfunctions for the Fourier operator. The classical uncertainty
Gabor-Heisenberg principle is revisited and the concept of isoresolution in
joint time-frequency analysis is introduced. It is shown that any Fourier
eigenfunction achieve isoresolution. It is shown that an isoresolution wavelet
can be derived from each known wavelet family by a suitable scaling.Comment: 6 pages, XX Simp\'osio Bras. de Telecomunica\c{c}\~oes, Rio de
Janeiro, Brazil, 2003. Fixed typo
- …