2,244 research outputs found
Outlier Mining Methods Based on Graph Structure Analysis
Outlier detection in high-dimensional datasets is a fundamental and challenging problem across disciplines that has also practical implications, as removing outliers from the training set improves the performance of machine learning algorithms. While many outlier mining algorithms have been proposed in the literature, they tend to be valid or efficient for specific types of datasets (time series, images, videos, etc.). Here we propose two methods that can be applied to generic datasets, as long as there is a meaningful measure of distance between pairs of elements of the dataset. Both methods start by defining a graph, where the nodes are the elements of the dataset, and the links have associated weights that are the distances between the nodes. Then, the first method assigns an outlier score based on the percolation (i.e., the fragmentation) of the graph. The second method uses the popular IsoMap non-linear dimensionality reduction algorithm, and assigns an outlier score by comparing the geodesic distances with the distances in the reduced space. We test these algorithms on real and synthetic datasets and show that they either outperform, or perform on par with other popular outlier detection methods. A main advantage of the percolation method is that is parameter free and therefore, it does not require any training; on the other hand, the IsoMap method has two integer number parameters, and when they are appropriately selected, the method performs similar to or better than all the other methods tested.Peer ReviewedPostprint (published version
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Location-free Spectrum Cartography
Spectrum cartography constructs maps of metrics such as channel gain or
received signal power across a geographic area of interest using spatially
distributed sensor measurements. Applications of these maps include network
planning, interference coordination, power control, localization, and cognitive
radios to name a few. Since existing spectrum cartography techniques require
accurate estimates of the sensor locations, their performance is drastically
impaired by multipath affecting the positioning pilot signals, as occurs in
indoor or dense urban scenarios. To overcome such a limitation, this paper
introduces a novel paradigm for spectrum cartography, where estimation of
spectral maps relies on features of these positioning signals rather than on
location estimates. Specific learning algorithms are built upon this approach
and offer a markedly improved estimation performance than existing approaches
relying on localization, as demonstrated by simulation studies in indoor
scenarios.Comment: 14 pages, 12 figures, 1 table. Submitted to IEEE Transactions on
Signal Processin
- …