Results 251 to 260 of about 323,408 (293)
Some of the next articles are maybe not open access.
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
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
An unsupervised attribute clustering algorithm for unsupervised feature selection
2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2015The curse of dimensionality refers to the problem that one faces when analyzing datasets with thousands or hundreds of thousands of attributes. This problem is usually tackled by different feature selection methods which have been shown to effectively reduce computation time, improve prediction performance, and facilitate better understanding of ...
Pei-Yuan Zhou, Keith C. C. Chan
openaire +1 more source
Unsupervised Video Surveillance
2011This paper addresses the problem of automatically learning common behaviors from long time observations of a scene of interest, with the purpose of classifying actions and, possibly, detecting anomalies. Unsupervised learning is used as an effective way to extract information from the scene with a very limited intervention of the user.
NOCETI, NICOLETTA, ODONE, FRANCESCA
openaire +3 more sources
Adherence to Unsupervised Exercise
The Physician and Sportsmedicine, 1983In brief: Forty-seven male police officers (mean age 41.0 years) were randomly assigned to three exercise groups: unsupervised, supervised, and control. Training consisted of walking and jogging three days per week for 20 weeks. The attrition rate for the unsupervised group (35%) was lower than for the supervised group (45%).
L R, Gettman, M L, Pollock, A, Ward
openaire +2 more sources
Unsupervised Recognition of ADLs
2010In this paper we present an approach to the unsupervised recognition of activities of daily living (ADLs) in the context of smart environments The developed system utilizes background domain knowledge about the user activities and the environment in combination with probabilistic reasoning methods in order to build best possible explanation of the ...
Todor Dimitrov +2 more
openaire +1 more source
Unsupervised pronunciation validation
2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009This paper addresses selecting between candidate pronunciations for out-of-vocabulary words in speech processing tasks. We introduce a simple, unsupervised method that outperforms the conventional supervised method of forced alignment with a reference. The success of this method is independently demonstrated using three metrics from large-scale speech ...
Christopher M. White +6 more
openaire +2 more sources
Unsupervised Learning: Clustering
2019In 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
2009We 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 +2 more
openaire +2 more sources
Pattern Recognition Letters, 1999
Summary: A new algorithm is proposed to carry out fuzzy clustering without making assumptions on initial guesses. The search for good clustering is made by a specific cluster-validity criterion. This tool has been tested on six data sets.
Noureddine Zahid +3 more
openaire +2 more sources
Summary: A new algorithm is proposed to carry out fuzzy clustering without making assumptions on initial guesses. The search for good clustering is made by a specific cluster-validity criterion. This tool has been tested on six data sets.
Noureddine Zahid +3 more
openaire +2 more sources
Generalization in Unsupervised Learning
2015We 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