Academic literature on the topic 'Probabilistic relaxation clustering'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Probabilistic relaxation clustering.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Probabilistic relaxation clustering"

1

Szilágyi, László, Szidónia Lefkovits, and Sándor M. Szilágyi. "Self-Tuning Possibilistic c-Means Clustering Models." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 27, Supp01 (November 5, 2019): 143–59. http://dx.doi.org/10.1142/s0218488519400075.

Full text
Abstract:
The relaxation of the probabilistic constraint of the fuzzy c-means clustering model was proposed to provide robust algorithms that are insensitive to strong noise and outlier data. These goals were achieved by the possibilistic c-means (PCM) algorithm, but these advantages came together with a sensitivity to cluster prototype initialization. According to the original recommendations, the probabilistic fuzzy c-means (FCM) algorithm should be applied to establish the cluster initialization and possibilistic penalty terms for PCM. However, when FCM fails to provide valid cluster prototypes due to the presence of noise, PCM has no chance to recover and produce a fine partition. This paper proposes a two-stage c-means clustering algorithm to tackle with most problems enumerated above. In the first stage called initialization, FCM with two modifications is performed: (1) extra cluster added for noisy data; (2) extra variable and constraint added to handle clusters of various diameters. In the second stage, a modified PCM algorithm is carried out, which also contains the cluster width tuning mechanism based on which it adaptively updates the possibilistic penalty terms. The proposed algorithm has less parameters than PCM when the number of clusters is [Formula: see text]. Numerical evaluation involving synthetic and standard test data sets proved the advantages of the proposed clustering model.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Yuxuan, Mian Liu, and Gang Luo. "Complex Temporal Patterns of Large Earthquakes: Devil’s Staircases." Bulletin of the Seismological Society of America 110, no. 3 (April 14, 2020): 1064–76. http://dx.doi.org/10.1785/0120190148.

Full text
Abstract:
ABSTRACT Periodic or quasiperiodic earthquake recurrence on individual faults, as predicted by the elastic rebound model, is not common in nature. Instead, most earthquake sequences are complex and variable, and often show clusters of events separated by long but irregular intervals of quiescence. Such temporal patterns are especially common for large earthquakes in complex fault zones or regional and global fault networks. Mathematically described as the Devil’s Staircase, such temporal patterns are a fractal property of nonlinear complex systems, in which a change of any part (e.g., rupture of a fault or fault segment) could affect the behavior of the whole system. We found that the lengths of the quiescent intervals between clusters are inversely related to tectonic-loading rates, whereas earthquake clustering can be attributed to many factors, including earthquake-induced viscoelastic relaxation and fault interaction. Whereas the underlying causes of the characteristics of earthquake sequences are not fully known, we attempted to statistically characterize these sequences. We found that most earthquake sequences are burstier than the Poisson model commonly used in probabilistic seismic hazard analysis, implying a higher probability of repeating events soon after a large earthquake.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Probabilistic relaxation clustering"

1

Zeng, Zhanggui. "Financial Time Series Analysis using Pattern Recognition Methods." University of Sydney, 2008. http://hdl.handle.net/2123/3558.

Full text
Abstract:
Doctor of Philosophy
This thesis is based on research on financial time series analysis using pattern recognition methods. The first part of this research focuses on univariate time series analysis using different pattern recognition methods. First, probabilities of basic patterns are used to represent the features of a section of time series. This feature can remove noise from the time series by statistical probability. It is experimentally proven that this feature is successful for pattern repeated time series. Second, a multiscale Gaussian gravity as a pattern relationship measurement which can describe the direction of the pattern relationship is introduced to pattern clustering. By searching for the Gaussian-gravity-guided nearest neighbour of each pattern, this clustering method can easily determine the boundaries of the clusters. Third, a method that unsupervised pattern classification can be transformed into multiscale supervised pattern classification by multiscale supervisory time series or multiscale filtered time series is presented. The second part of this research focuses on multivariate time series analysis using pattern recognition. A systematic method is proposed to find the independent variables of a group of share prices by time series clustering, principal component analysis, independent component analysis, and object recognition. The number of dependent variables is reduced and the multivariate time series analysis is simplified by time series clustering and principal component analysis. Independent component analysis aims to find the ideal independent variables of the group of shares. Object recognition is expected to recognize those independent variables which are similar to the independent components. This method provides a new clue to understanding the stock market and to modelling a large time series database.
APA, Harvard, Vancouver, ISO, and other styles
2

Zeng, Zhanggui. "Financial Time Series Analysis using Pattern Recognition Methods." Thesis, The University of Sydney, 2006. http://hdl.handle.net/2123/3558.

Full text
Abstract:
This thesis is based on research on financial time series analysis using pattern recognition methods. The first part of this research focuses on univariate time series analysis using different pattern recognition methods. First, probabilities of basic patterns are used to represent the features of a section of time series. This feature can remove noise from the time series by statistical probability. It is experimentally proven that this feature is successful for pattern repeated time series. Second, a multiscale Gaussian gravity as a pattern relationship measurement which can describe the direction of the pattern relationship is introduced to pattern clustering. By searching for the Gaussian-gravity-guided nearest neighbour of each pattern, this clustering method can easily determine the boundaries of the clusters. Third, a method that unsupervised pattern classification can be transformed into multiscale supervised pattern classification by multiscale supervisory time series or multiscale filtered time series is presented. The second part of this research focuses on multivariate time series analysis using pattern recognition. A systematic method is proposed to find the independent variables of a group of share prices by time series clustering, principal component analysis, independent component analysis, and object recognition. The number of dependent variables is reduced and the multivariate time series analysis is simplified by time series clustering and principal component analysis. Independent component analysis aims to find the ideal independent variables of the group of shares. Object recognition is expected to recognize those independent variables which are similar to the independent components. This method provides a new clue to understanding the stock market and to modelling a large time series database.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Probabilistic relaxation clustering"

1

Newman, Timothy S., Jinsoo Lee, and Scott R. Vechinski. "Target extraction using hierarchical clustering with refinement by probabilistic relaxation labeling." In Aerospace/Defense Sensing and Controls, edited by Firooz A. Sadjadi. SPIE, 1998. http://dx.doi.org/10.1117/12.323860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography