نتایج جستجو برای: automatic clustering

تعداد نتایج: 240982  

Journal: :International Journal of Intelligence Science 2013

1997
Hubert Jin Francis Kubala Rich Schwartz

This paper presents a fully automatic speaker clustering algorithm, which consists of three components: building a distance matrix based on Gaussian models of the acoustic segments; performing hierarchical clustering on the distance matrix with the prior assumption that consecutive segments should be more likely to come from the same speaker; and selecting the best clustering solution automatic...

Journal: :International Journal of Electrical and Computer Engineering (IJECE) 2016

2013
R. J. Kuo Ferani E. Zulvia

Unsupervised data clustering is an important analysis in data mining. Many clustering algorithms have been proposed, yet most of them require predefined number of clusters. Unfortunately, unavailable information regarding number of clusters is commonly happened in real-world problems. Thus, this paper intends to overcome this problem by proposing an algorithm for automatic clustering. The propo...

2004
David Grangier Alessandro Vinciarelli

This paper presents clustering experiments performed over noisy texts (i.e. texts that have been extracted through an automatic process like character or speech recognition). The effect of recognition errors is investigated by comparing clustering results performed over both clean (manually typed data) and noisy (automatic speech transcriptions) versions of the same speech recording corpus.

2000
Dina Goren-Bar Tsvi Kuflik Dror Lev

Automatic Document Classification that corresponds with user-predefined classes is a challenging and widely researched area. Self-Organizing Maps (SOM) are unsupervised Artificial Neural Networks (ANN) which are mathematically characterized by transforming high-dimensional data into two-dimension representation, enabling automatic clustering of the input, while preserving higher order topology....

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1994
Ja-Chen Lin Wen-Hsiang Tsai

We propose in this correspondence a new method to perform two-class clustering of 2-D data in a quick and automatic way by preserving certain features of the input data. The method is analytical, deterministic, unsupervised, automatic, and noniterative. The computation time is of order n if the data size is n, and hence much faster than any other method which requires the computation of an n-by...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید