English
Related papers

Related papers: Metodos de Agrupamentos em dois Estagios

200 papers

In this paper we apply the Self-Organized Map (SOM) method for clustering the DJIA and NASDAQ100 portfolios for determination of non-linear correlations between stocks. We represent the application of this method as alternative to…

Disordered Systems and Neural Networks · Physics 2016-08-31 A. A. Zherebtsov , Yu. A. Kuperin

This paper presents a novel time series clustering method, the self-organising eigenspace map (SOEM), based on a generalisation of the well-known self-organising feature map (SOFM). The SOEM operates on the eigenspaces of the embedded…

Machine Learning · Statistics 2019-05-15 Donya Rahmani , Damien Fay , Jacek Brodzki

Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular methods like K-means, may suffer from instability as they are…

Optimization and Control · Mathematics 2018-02-21 Yancheng Yuan , Defeng Sun , Kim-Chuan Toh

In the recent years, there is a growing interest in semi-supervised learning, since, in many learning tasks, there is a plentiful supply of unlabeled data, but insufficient labeled ones. Hence, Semi-Supervised learning models can benefit…

Machine Learning · Computer Science 2020-03-27 Pedro H. M. Braga , Hansenclever F. Bassani

Clustering is widely used in unsupervised learning to find homogeneous groups of observations within a dataset. However, clustering mixed-type data remains a challenge, as few existing approaches are suited for this task. This study…

Machine Learning · Statistics 2025-11-26 Badih Ghattas , Alvaro Sanchez San-Benito

We address general-shaped clustering problems under very weak parametric assumptions with a two-step hybrid robust clustering algorithm based on trimmed k-means and hierarchical agglomeration. The algorithm has low computational complexity…

Methodology · Statistics 2022-01-19 Luca Insolia , Domenico Perrotta

Self-organising maps are a powerful tool for cluster analysis in a wide range of data contexts. From the pioneer work of Kohonen, many variants and improvements have been proposed. This review focuses on the last decade, in order to provide…

Neural and Evolutionary Computing · Computer Science 2025-01-16 Axel Guérin , Pierre Chauvet , Frédéric Saubion

Comparison of three kind of the clustering and find cost function and loss function and calculate them. Error rate of the clustering methods and how to calculate the error percentage always be one on the important factor for evaluating the…

Machine Learning · Computer Science 2014-11-14 Kamran Kowsari

There is an increasing demand for scalable algorithms capable of clustering and analyzing large time series datasets. The Kohonen self-organizing map (SOM) is a type of unsupervised artificial neural network for visualizing and clustering…

Machine Learning · Computer Science 2021-08-27 Ali Javed , Donna M. Rizzo , Byung Suk Lee , Robert Gramling

We introduce a multidimensional, neural-network approach to reveal and measure urban segregation phenomena, based on the Self-Organizing Map algorithm (SOM). The multidimensionality of SOM allows one to apprehend a large number of variables…

Physics and Society · Physics 2018-06-06 Madalina Olteanu , Aurélien Hazan , Marie Cottrell , Julien Randon-Furling

Ensemble approaches for deep-learning-based semantic segmentation remain insufficiently explored despite the proliferation of competitive benchmarks and downstream applications. In this work, we explore and benchmark the popular ensembling…

Computer Vision and Pattern Recognition · Computer Science 2022-10-12 Rawal Khirodkar , Brandon Smith , Siddhartha Chandra , Amit Agrawal , Antonio Criminisi

We present a solution for a two-phase facility planning scenario where in the first phase, there is some flexibility in determining where the locations of facilities (or sources) should fall. And in the second phase, new waypoints (or…

Optimization and Control · Mathematics 2020-09-08 Larkin Liu

This work addresses the performance comparison between four clustering techniques with the objective of achieving strong hybrid models in supervised learning tasks. A real dataset from a bio-climatic house named Sotavento placed on…

The problem of data clustering is one of the most important in data analysis. It can be problematic when dealing with experimental data characterized by measurement uncertainties and errors. Our paper proposes a recursive scheme for…

Machine Learning · Computer Science 2024-01-12 Alicja Miniak-Górecka , Krzysztof Podlaski , Tomasz Gwizdałła

Acyclic join queries can be evaluated instance-optimally using Yannakakis' algorithm, which avoids needlessly large intermediate results through semi-join passes. Recent work proposes to address the significant hidden constant factors…

Databases · Computer Science 2025-05-26 Liese Bekkers , Frank Neven , Stijn Vansummeren , Yisu Remy Wang

Cluster analysis methods seek to partition a data set into homogeneous subgroups. It is useful in a wide variety of applications, including document processing and modern genetics. Conventional clustering methods are unsupervised, meaning…

Methodology · Statistics 2014-07-11 Eric Bair

We propose a framework for Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to interact with a domain expert, asking whether two given instances belong to the same cluster or not. We study the query and…

Machine Learning · Computer Science 2016-11-23 Hassan Ashtiani , Shrinu Kushagra , Shai Ben-David

Self-Organizing Map algorithms have been used for almost 40 years across various application domains such as biology, geology, healthcare, industry and humanities as an interpretable tool to explore, cluster and visualize high-dimensional…

Neural and Evolutionary Computing · Computer Science 2020-11-12 Florent Forest , Mustapha Lebbah , Hanane Azzag , Jérôme Lacaille

Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…

Data Structures and Algorithms · Computer Science 2016-05-24 Nicolas Tremblay , Gilles Puy , Remi Gribonval , Pierre Vandergheynst

Classification algorithms to mine data stream have been extensively studied in recent years. However, a lot of these algorithms are designed for supervised learning which requires labeled instances. Nevertheless, the labeling of the data is…