Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/327940
Type: Congresso
Title: Smoothed Multiple Binarization - Using Pqr Tree, Smoothing, Feature Vectors And Thresholding For Matrix Reordering
Author: Medina
Bruno F.; Kawakami
Willian H.; da Silva
Maressa R.; da Silva
Celmar G.
Abstract: Finding appropriate permutations of rows and columns of a matrix may help users to see hidden patterns in datasets. This paper presents a set of binarization-based matrix reordering algorithms able to reveal some patterns in a quantitative data set. In these algorithms, matrix binarization converts a matrix into a set of binary ones, from which the algorithms calculate desired groups of similar rows and columns. PQR trees provide a linear order of rows and columns that obey these groups as much as possible. These algorithms use mean or median filter as smoothing techniques to minimize data noise in intermediate matrix permutation steps. They also use feature vectors or thresholding for defining binarization thresholds in intermediate steps. Our experiments with synthetic matrices revealed that our algorithms are competitive with other matrix reordering algorithms in terms of quality of reordering (Moore stress) and runtime. We observed that our set of algorithms is suitable to reveal Circumplex pattern with all tested noise ratios, and other data canonical patterns with low noise ratio.
Subject: Matrix Reordering
Reordering Algorithm
Pqr-tree
Pattern Recognition
Editor: IEEE
New York
Rights: fechado
Identifier DOI: 10.1109/IV.2016.22
Address: http://ieeexplore.ieee.org/document/7557909/
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000389494200015.pdf512.5 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.