Results 321 to 330 of about 2,740,047 (370)
Some of the next articles are maybe not open access.
An Approach to Unsupervised Learning Classification
IEEE Transactions on Computers, 1975In this correspondence, an approach to unsupervised pattern classifiers is discussed. The classifiers discussed here have the ability of obtaining the consistent estimates of unknown statistics of input patterns without knowing the a priori probability of each category's occurrence where the input patterns are of a mixture distribution.
Mizoguchi, R., Shimura, Masamichi
openaire +2 more sources
Dissecting cancer heterogeneity – An unsupervised classification approach
The International Journal of Biochemistry & Cell Biology, 2013Gene-expression-based classification studies have changed the way cancer is traditionally perceived. It is becoming increasingly clear that many cancer types are in fact not single diseases but rather consist of multiple molecular distinct subtypes. In this review, we discuss unsupervised classification studies of common malignancies during the recent ...
Wang, Xin +4 more
openaire +2 more sources
Absolute Classification with Unsupervised Clustering
[Proceedings] IGARSS '92 International Geoscience and Remote Sensing Symposium, 2005An absolute classification algorithm is proposed in which the class definition through training samples or otherwise is required only for a particular class of interest. The absolute classification is considered as a problem of unsupervised clustering when one cluster is known initially.
null Byeungwoo Jeon, D.A. Landgrebe
openaire +1 more source
Unsupervised Sentiment Classification
2016This chapter describes the design and implementation of the unsupervised sentiment classification procedure. The classification procedure consisted of two core components: a bespoke sentiment analysis system developed by the author and the SenticNet sentiment lexicon. The sentiment lexicon acted as the source of sentiment information, and the sentiment
openaire +1 more source
Unsupervised text independent speaker classification
Eighteenth Convention of Electrical and Electronics Engineers in Israel, 2002Speaker recognition and verification has been used in a variety of commercial, forensic and military applications. The classical problem is that of supervised recognition, in which there is sufficient a priori information on the speakers to be identified. In such cases, the recognition system has speaker models, estimated during training sessions. This
A. Cohen, V. Lapidus
openaire +1 more source
IEEE Transactions on Geoscience and Remote Sensing, 2019
Feature learning technologies using convolutional neural networks (CNNs) have shown superior performance over traditional hand-crafted feature extraction algorithms.
Shaohui Mei +5 more
semanticscholar +1 more source
Feature learning technologies using convolutional neural networks (CNNs) have shown superior performance over traditional hand-crafted feature extraction algorithms.
Shaohui Mei +5 more
semanticscholar +1 more source
Unsupervised classification using associative memory
The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002., 2003In this paper, we present unsupervised classification using the Lyapunov Associative Memory (LYAM) system. This associative memory encodes the classification results as its equilibrium states. The system is modeled with only a set of nonlinear ordinary differential equations. An example is given for signal sorting application.
M.R. Sayeh, B. Li
openaire +1 more source
Clustering and Unsupervised Classification
1986The successful application of maximum likelihood classification is dependent upon having delineated correctly the spectral classes in the image data of interest. This is necessary since each class is to be modelled by a normal probability distribution, as discussed in Chap. 8.
openaire +1 more source
Unsupervised Rough Set Classification Using GAs
Journal of Intelligent Information Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

