Results 241 to 250 of about 6,372,670 (283)

Detecting deformation mechanisms of metals from acoustic emission signals through knowledge-driven unsupervised learning. [PDF]

Nat Commun
Gou B, Chen Y, Xu S, Sun J, Lookman T, Salje EKH, Ding X.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fairness in Unsupervised Learning

Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020
Data in digital form is expanding at an exponential rate, far outpacing any chance of getting any significant fraction labelled manually. This has resulted in heightened research emphasis on unsupervised learning, learning in the absence of labels. In fact, unsupervised learning has been often dubbed as the next frontier of AI. Unsupervised learning is
Deepak P 0001, Joemon M. Jose, Sanil V
openaire   +1 more source

Unsupervised Learning

Neural Computation, 1989
What use can the brain make of the massive flow of sensory information that occurs without any associated rewards or punishments? This question is reviewed in the light of connectionist models of unsupervised learning and some older ideas, namely the cognitive maps and working models of Tolman and Craik, and the idea that redundancy is important for ...
openaire   +2 more sources

Unsupervised Learning: Clustering

2019
In this article an introduction on unsupervised cluster analysis is provided. Clustering is the organisation of unlabelled data into similarity groups called clusters. A cluster is a collection of data items which are similar between them, and dissimilar to data items in other clusters.
Serra A., Tagliaferri R.
openaire   +1 more source

Spicules for Unsupervised Learning

2009
We present a new model of unsupervised competitive neural network, based on spicules. This model is capable of detecting topological information of an input space, determining its orientation and, in most case, its skeleton.
José Antonio Gómez-Ruiz, José Muñoz-Pérez, M. Angeles García-Bernal   +2 more
openaire   +2 more sources

Generalization in Unsupervised Learning

2015
We are interested in the following questions. Given a finite data set S, with neither labels nor side information, and an unsupervised learning algorithm A, can the generalization of A be assessed on S? Similarly, given two unsupervised learning algorithms, A1 and A2, for the same learning task, can one assess whether one will generalize "better" on ...
Karim T. Abou-Moustafa, Dale Schuurmans
openaire   +2 more sources

Unsupervised Reinforcement Learning

International Joint Conference on Autonomous Agents and Multiagent Systems, 2020
Conventionally, reinforcement learning algorithms are goal-directed: they aim to acquire policies that most effectively maximize a given reward signal. However, if we consider agents that must master very large repertoires of behaviors -- such as general-purpose robots that must perform a diverse array of tasks in the real world -- then it makes sense ...
openaire   +2 more sources

Unsupervised Learning in Metagame

1999
The Metagame approach to computer game playing, introduced by Pell, involves writing programs that can play many games from some laxge class, rather thein programs speciailised to play just a single game such as chess. Metagame programs take the rules of a randomly generated game as input, then do some analysis of that game, and then play the game ...
Graham E. Farr, David R. Powell
openaire   +2 more sources

Unsupervised learning of action primitives

2010 10th IEEE-RAS International Conference on Humanoid Robots, 2010
Action representation is a key issue in imitation learning forhumanoids. With the recent finding of mirror neurons there has been agrowing interest in expressing actions as a combination meaningfulsubparts called primitives. Primitives could be thought of as analphabet for the human actions. In this paper we observe that humanactions and objects can be
San Mohan, Volker Krüger, Danica Kragic
openaire   +1 more source

Unsupervised learning with stochastic gradient

Neurocomputing, 2005
A stochastic gradient is formulated based on deterministic gradient augmented with Cauchy simulated annealing capable to reach a global minimum with a convergence speed significantly faster then when simulated annealing is used alone. In order to solve space-time variant inverse problems known as blind source separation, a novel Helmholtz free energy ...
Harold Szu, Ivica Kopriva
openaire   +3 more sources