The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Correntropy: Properties and Applications in Non-Gaussian Signal Processing
Abstract
The optimality of second-order statistics depends heavily on the assumption of Gaussianity. In this paper, we elucidate further the probabilistic and geometric meaning of the recently defined correntropy function as a localized similarity measure. A close relationship between correntropy and M-estimation is established. Connections and differences between correntropy and kernel methods are presented. As such correntropy has vastly different properties compared with second-order statistics that can be very useful in non-Gaussian signal processing, especially in the impulsive noise environment. Examples are presented to illustrate the technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
Density Estimation for Statistics and Data Analysis
(1986) · Springer eBooks · doi:10.1007/978-1-4899-3324-9 · Cited by 8,525
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Fast and robust fixed-point algorithms for independent component analysis
Hyvarinen, A. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.761722 · Cited by 6,246
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Neural and adaptive systems : fundamentals through simulations
Príncipe, J. C., Euliano, N. R., & Lefebvre, W. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 991
Information Theoretic Learning
Erdogmus, D., & Principe, J. C. (2009) · Encyclopedia of Artificial Intelligence · doi:10.4018/978-1-59904-849-9.ch133 · Cited by 506
Self-citationGeneralized correlation function: definition, properties, and application to blind equalization
Santamaría, I., Pokharel, P. P., & Príncipe, J. C. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872524 · Cited by 457
Self-citationNeural and Adaptive Systems: Fundamentals Through Simulations
Chen, K., Kvasnicka, V., Kanen, P. C., & Haykin, S. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2001.925574 · Cited by 416
An error-entropy minimization algorithm for supervised training of nonlinear adaptive systems
Erdogmus, D., & Principe, J. C. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1011217 · Cited by 353
Self-citationKernel Methods for Measuring Independence
Gretton, A., Herbrich, R., Smola, A. J., Bousquet, O., & Schölkopf, B. (2005) · ANU Open Research (Australian National University) · doi:10.5555/1046920.1194914 · Cited by 332
Generalized information potential criterion for adaptive system training
Erdogmus, D., & Principe, J. C. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1031936 · Cited by 237
Self-citationIntegrating a Robust Option into a Multiple Regression Computing Environment
Dumouchel, W., & O’brien, F. (1991) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4613-9154-8_3 · Cited by 184
Feature extraction using information-theoretic learning
Hild, K. E., Erdogmus, D., Torkkola, K., & Principe, J. C. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.186 · Cited by 160
Self-citationLearning from Examples with Information Theoretic Criteria
Príncipe, J. C., Xu, D., Zhao, Q. C., & Fisher, J. S. (2000) · The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology · doi:10.1023/a:1008143417156 · Cited by 136
Deniz Erdogmus, B., & Príncipe, J. C. (2006) · IEEE Signal Processing Magazine · doi:10.1109/sp-m.2006.248709 · Cited by 86
Beyond second-order statistics for learning: A pairwise interaction model for entropy estimation
Deniz Erdogmus, B., Príncipe, J. C., & Hild, K. E. (2002) · Natural Computing · doi:10.1023/a:1015064029375 · Cited by 16
A Closed Form Solution for a Nonlinear Wiener Filter
Pokharel, P. P., Xu, J., Erdoğmuş, D., et al. (2006) · doi:10.1109/icassp.2006.1660755 · Cited by 16
Self-citationKernel Based Synthetic Discriminant Function for Object Recognition
Jeong, K.-H., Pokharel, P. P., Xu, J., Han, S., & Príncipe, J. C. (2006) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2006.1661388 · Cited by 10
Self-citation
Cited by
Maximum correntropy Kalman filter
Chen, B., Liu, X., Zhao, H., & Principe, J. C. (2017) · Automatica · doi:10.1016/j.automatica.2016.10.004 · Cited by 923
Self-citationClassification with Noisy Labels by Importance Reweighting
Liu, T., & Tao, D. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2456899 · Cited by 782
A novel deep autoencoder feature learning method for rotating machinery fault diagnosis
Shao, H., Jiang, H., Zhao, H., & Wang, F. (2017) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2017.03.034 · Cited by 684
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Robust Principal Component Analysis Based on Maximum Correntropy Criterion
He, R., Hu, B.-G., Zheng, W.-S., & Kong, X.-W. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2103949 · Cited by 359
Metadata
- Authors
- Liu, W., Pokharel, P. P., & Principe, J. C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2007-11
- Volume
- 55
- Issue
- 11
- Pages
- 5286-5298
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2135160607
- Cited by
- 1,695
- References
- 23
- FWCI
- 21.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.