scholarly journals Classical Equivalent Quantum Unsupervised Learning Algorithms

2020 ◽  
Vol 167 ◽  
pp. 1849-1860 ◽  
Author(s):  
Prakhar Shrivastava ◽  
Kapil Kumar Soni ◽  
Akhtar Rasool
Keyword(s):  
Unsupervised Learning ◽  
Learning Algorithms ◽  
Equivalent Quantum

Probability Density Methods for Smooth Function Approximation and Learning in Populations of Tuned Spiking Neurons

1998 ◽  
Vol 10 (6) ◽  
pp. 1567-1586 ◽  
Author(s):  
Terence David Sanger
Keyword(s):  
Unsupervised Learning ◽  
Learning Algorithms ◽  
External Input ◽  
Spiking Neurons ◽  
Intermediate Cell ◽  
Continuous Variables ◽  
Neural Firing ◽  
Tuning Curves ◽  
Cell Firing ◽  
Density Methods

This article proposes a new method for interpreting computations performed by populations of spiking neurons. Neural firing is modeled as a rate-modulated random process for which the behavior of a neuron in response to external input can be completely described by its tuning function. I show that under certain conditions, cells with any desired tuning functions can be approximated using only spike coincidence detectors and linear operations on the spike output of existing cells. I show examples of adaptive algorithms based on only spike data that cause the underlying cell-tuning curves to converge according to standard supervised and unsupervised learning algorithms. Unsupervised learning based on principal components analysis leads to independent cell spike trains. These results suggest a duality relationship between the random discrete behavior of spiking cells and the deterministic smooth behavior of their tuning functions. Classical neural network approximation methods and learning algorithms based on continuous variables can thus be implemented within networks of spiking neurons without the need to make numerical estimates of the intermediate cell firing rates.

Proficient Normalised Fuzzy K-Means With Initial Centroids Methodology

2018 ◽  
Vol 8 (1) ◽  
pp. 42-59
Author(s):  
Deepali Virmani ◽  
Nikita Jain ◽  
Ketan Parikh ◽  
Shefali Upadhyaya ◽  
Abhishek Srivastav
Keyword(s):  
Unsupervised Learning ◽  
Real World ◽  
Learning Algorithms ◽  
Clustering Algorithms ◽  
Real World Data ◽  
World Data ◽  
Clustering Problem ◽  
Time Required ◽  
Selection Of

This article describes how data is relevant and if it can be organized, linked with other data and grouped into a cluster. Clustering is the process of organizing a given set of objects into a set of disjoint groups called clusters. There are a number of clustering algorithms like k-means, k-medoids, normalized k-means, etc. So, the focus remains on efficiency and accuracy of algorithms. The focus is also on the time it takes for clustering and reducing overlapping between clusters. K-means is one of the simplest unsupervised learning algorithms that solves the well-known clustering problem. The k-means algorithm partitions data into K clusters and the centroids are randomly chosen resulting numeric values prohibits it from being used to cluster real world data containing categorical values. Poor selection of initial centroids can result in poor clustering. This article deals with a proposed algorithm which is a variant of k-means with some modifications resulting in better clustering, reduced overlapping and lesser time required for clustering by selecting initial centres in k-means and normalizing the data.

scholarly journals Unsupervised learning algorithms applied to grouping problems

2020 ◽  
Vol 175 ◽  
pp. 677-682
Author(s):  
Amelec Viloria ◽  
Nelson Alberto Lizardo Zelaya ◽  
Noel Varela
Keyword(s):  
Unsupervised Learning ◽  
Learning Algorithms

scholarly journals Hybrid feature selection model based on machine learning and knowledge graph

2021 ◽  
Vol 2079 (1) ◽  
pp. 012028
Author(s):  
Xiaoqing Peng ◽  
Yong Shuai ◽  
Yaxi Gan ◽  
Yaokai Chen
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Unsupervised Learning ◽  
Supervised Learning ◽  
Learning Algorithms ◽  
Selection Model ◽  
Knowledge Graph ◽  
Model Based ◽  
Text Features ◽  
Learning Data

Abstract Aiming at the problem that the current feature selection algorithm can not adapt to both supervised learning data and unsupervised learning data, and had poor feature interpretability, this paper proposed a hybrid feature selection model based on machine learning and knowledge graph. By the idea of hybridization, this model used supervised learning algorithms, unsupervised learning algorithms and knowledge graph technology to model from the perspective of data features and text features. Firstly, the data-based feature weights were obtained through the machine learning model, and then the text-based weights were obtained by using the knowledge graph technology, and the weight sets are combined to obtain a feature matrix with good explanatory properties that meets both the data and text features. Finally, the case analysis proves that the method proposed in this paper has good effects and interpretability.

scholarly journals Combining Supervised and Unsupervised Learning Algorithms for Human Activity Recognition

Sensors ◽  
2021 ◽  
Vol 21 (18) ◽  
pp. 6309
Author(s):  
Elena-Alexandra Budisteanu ◽  
Irina Georgiana Mocanu
Keyword(s):  
Unsupervised Learning ◽  
Activity Recognition ◽  
Human Activity ◽  
Data Augmentation ◽  
Learning Algorithms ◽  
Human Activity Recognition ◽  
Convolutional Networks ◽  
Supervised And Unsupervised Learning ◽  
Novel Approach ◽  
Unsupervised Deep Learning

Human activity recognition is an extensively researched topic in the last decade. Recent methods employ supervised and unsupervised deep learning techniques in which spatial and temporal dependency is modeled. This paper proposes a novel approach for human activity recognition using skeleton data. The method combines supervised and unsupervised learning algorithms in order to provide qualitative results and performance in real time. The proposed method involves a two-stage framework: the first stage applies an unsupervised clustering technique to group up activities based on their similarity, while the second stage classifies data assigned to each group using graph convolutional networks. Different clustering techniques and data augmentation strategies are explored for improving the training process. The results were compared against the state of the art methods and the proposed model achieved 90.22% Top-1 accuracy performance for NTU-RGB+D dataset (the performance was increased by approximately 9% compared with the baseline graph convolutional method). Moreover, inference time and total number of parameters stay within the same magnitude order. Extending the initial set of activities with additional classes is fast and robust, since there is no required retraining of the entire architecture but only to retrain the cluster to which the activity is assigned.

Sign in / Sign up

Export Citation Format

Share Document