Analyzing documents with quantum clustering: a novel pattern recognition algorithm based on quantum mechanics
The article introduces Quantum Clustering, a novel pattern recognition algorithm inspired by quantum mechanics and extend it to text analysis. This novel method improves upon nonparametric density estimation (i.e. Parzen-window), and differentiates itself from it in a significant way, Quantum Cluste...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
24 March 2016
|
| In: |
Molecular and biochemical parasitology
Year: 2016, Volume: 77, Pages: 8-13 |
| ISSN: | 1872-9428 |
| DOI: | 10.1016/j.patrec.2016.03.008 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/j.patrec.2016.03.008 Verlag, lizenzpflichtig, Volltext: http://www.sciencedirect.com/science/article/pii/S0167865516000775 
|
| Author Notes: | Ding Liu, Minghu Jiang, Xiaofang Yang, Hui Li |
| Summary: | The article introduces Quantum Clustering, a novel pattern recognition algorithm inspired by quantum mechanics and extend it to text analysis. This novel method improves upon nonparametric density estimation (i.e. Parzen-window), and differentiates itself from it in a significant way, Quantum Clustering constructs the potential function to determine the cluster center instead of the Gaussian kernel function. Specifically, detailed comparative analysis shows that the potential function could clearly reveal the underlying structure of the data that the Gaussian kernel could not handle. Moreover, the problem of parameter estimation is solved successfully by the numerical optimization approach (i.e. Pattern Search). Afterwards, the results of detailed comparative experiments on three benchmark datasets confirms the advantage of Quantum Clustering over the Parzen-window, and the additional trial on authorship identification illustrates the wide application scope of this novel method. |
|---|---|
| Item Description: | Gesehen am 27.05.2020 |
| Physical Description: | Online Resource |
| ISSN: | 1872-9428 |
| DOI: | 10.1016/j.patrec.2016.03.008 |