Novel Representation of Multidimensional Datasets: The Framework nD-EVM/Kohonen
نویسندگان
چکیده
In this paper we are going to describe the steps that conform a novel approach for representation of multidimensional datasets through the proposed Framework nD-EVM/Kohonen. In this sense two phases are going to be taken in account: 1) the application of 1-Dimensional Kohonen Self-Organizing Maps (1D-KSOMs) in order to achieve (n-1)D hypervoxelizations' segmentations, n ≥ 2, taking in account their geometrical and topological properties to characterize the information contained in the datasets. 2) The segmented multidimensional datasets are specified as Orthogonal Polytopes whose n-th Dimension is associated to a 1D-KSOM classification. Subsequently, the nD representation is concisely expressed via the Extreme Vertices Model in the n-Dimensional Space (nD-EVM). There is presented a comparative analysis based on the use of False Color Maps in order to understand they way our considered 1D-KSOMs distribute appropriately their weights vectors along the classification space, even better than classifications based exclusively on color intensity. Additionally, we present some arguments to sustain that a 1D-KSOM is an adequate option in terms of temporal complexity and, on the other hand, that our representation is concise in terms of spatial complexity because of the nD-EVM properties. Index Terms Representation and Manipulation of Hypervoxelizations, Polytopes Representation Schemes, Geometrical and Topological Interrogations, 1-Dimensional Kohonen Self-Organizing Maps, False Color Maps
منابع مشابه
Efficient Computation of Regularized Boolean Operations on the Extreme Vertices Model in the n-Dimensional Space (nD-EVM)
The objective behind this work is to describe the Extreme Vertices Model in the n-Dimensional Space (nD-EVM) and the way it represents nD Orthogonal Pseudo Polytopes (nD-OPPs) by considering only a subset of their vertices: the Extreme Vertices. There are presented the Regularized Boolean Operators and the way they assure the dimensional homogeneity. Algorithms for performing Regularized Boolea...
متن کاملMultidimensional Scaling and Kohonen's Self-organizing Maps
Two methods providing representation of high dimensional input data in a lower dimensional target space are compared Although multidimensional scaling MDS and Kohonen s self organizing maps SOM are dedicated to very di erent applications both methods are based on an iterative process that tends to approximate the topography of high dimensional data and both can be used to model self organizatio...
متن کاملGrowing Self-Organizing Maps for Data Analysis
Currently, there exist many research areas that produce large multivariable datasets that are difficult to visualize in order to extract useful information. Kohonen selforganizing maps have been used successfully in the visualization and analysis of multidimensional data. In this work, a projection technique that compresses multidimensional datasets into two dimensional space using growing self...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملA confidence-aware interval-based trust model
It is a common and useful task in a web of trust to evaluate the trust value between two nodes using intermediate nodes. This technique is widely used when the source node has no experience of direct interaction with the target node, or the direct trust is not reliable enough by itself. If trust is used to support decision-making, it is important to have not only an accurate estimate of trust, ...
متن کامل