On the public citation graph

https://doi.org/10.2139/ssrn.4665754

0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s11760-018-1272-2openalex-extracted
An ultrasonic positioning algorithm based on maximum correntropy criterion extended Kalman filter weighted centroid
inferredcites →https://doi.org/10.1016/j.automatica.2016.10.004openalex-extracted
Maximum correntropy Kalman filter
inferredcites →https://doi.org/10.1016/j.isatra.2018.05.001openalex-extracted
Maximum correntropy square-root cubature Kalman filter with application to SINS/GPS integrated systems
inferredcites →https://doi.org/10.1016/j.jfranklin.2017.10.023openalex-extracted
Maximum correntropy unscented Kalman and information filters for non-Gaussian measurement noise
inferredcites →https://doi.org/10.1016/j.neucom.2013.04.037openalex-extracted
Kernel minimum error entropy algorithm
inferredcites →https://doi.org/10.1016/j.sigpro.2018.04.017openalex-extracted
Switching criterion for sub-and super-Gaussian additive noise in adaptive filtering
inferredcites →https://doi.org/10.1016/j.sigpro.2019.02.030openalex-extracted
A distributed maximum correntropy Kalman filter
inferredcites →https://doi.org/10.1016/j.sigpro.2020.107914openalex-extracted
Numerically stable minimum error entropy Kalman filter
inferredcites →https://doi.org/10.1016/j.sigpro.2021.108410openalex-extracted
A kernel recursive minimum error entropy adaptive filter
inferredcites →https://doi.org/10.1080/00207721.2016.1277407openalex-extracted
Maximum correntropy unscented filter
inferredcites →https://doi.org/10.1109/icassp.2017.7953410openalex-extracted
Learning sparse graphs under smoothness prior
inferredcites →https://doi.org/10.1109/lsp.2015.2428713openalex-extracted
Convergence of a Fixed-Point Algorithm under Maximum Correntropy Criterion
inferredcites →https://doi.org/10.1109/lsp.2021.3055748openalex-extracted
Robust Minimum Error Entropy Based Cubature Information Filter With Non-Gaussian Measurement Noise
inferredcites →https://doi.org/10.1109/msp.2012.2235192openalex-extracted
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
inferredcites →https://doi.org/10.1109/msp.2018.2890143openalex-extracted
Connecting the Dots: Identifying Network Structure via Graph Signal Processing
inferredcites →https://doi.org/10.1109/tim.2020.2999757openalex-extracted
Robust Power System State Estimation With Minimum Error Entropy Unscented Kalman Filter
inferredcites →https://doi.org/10.1109/tnn.2010.2050212openalex-extracted
Mean-Square Convergence Analysis of ADALINE Training With Minimum Error Entropy Criterion
inferredcites →https://doi.org/10.1109/tnnls.2019.2955209openalex-extracted
Robust Structured Graph Clustering
inferredcites →https://doi.org/10.1109/tnnls.2021.3110982openalex-extracted
Cross-Domain Graph Anomaly Detection
inferredcites →https://doi.org/10.1109/tsmc.2019.2917712openalex-extracted
Linear and Nonlinear Regression-Based Maximum Correntropy Extended Kalman Filtering
inferredcites →https://doi.org/10.1109/tsmc.2019.2957269openalex-extracted
Minimum Error Entropy Kalman Filter
inferredcites →https://doi.org/10.1109/tsmc.2022.3161412openalex-extracted
Dual Extended Kalman Filter Under Minimum Error Entropy With Fiducial Points
inferredcites →https://doi.org/10.1109/tsp.2007.896065openalex-extracted
Correntropy: Properties and Applications in Non-Gaussian Signal Processing
inferredcites →https://doi.org/10.1109/tsp.2015.2437836openalex-extracted
Minimum Total Error Entropy Method for Parameter Estimation
inferredcites →https://doi.org/10.1109/tsp.2016.2539127openalex-extracted
Generalized Correntropy for Robust Adaptive Filtering
inferredcites →https://doi.org/10.1109/tsp.2017.2669903openalex-extracted
Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering
inferredcites →https://doi.org/10.1109/tsp.2017.2690388openalex-extracted
Stationary Signal Processing on Graphs
inferredcites →https://doi.org/10.1109/tsp.2018.2864654openalex-extracted
Rating Prediction via Graph Signal Processing
inferredcites →https://doi.org/10.1109/tsp.2019.2896229openalex-extracted
Graph Topology Inference Based on Sparsifying Transform Learning
inferredcites →https://doi.org/10.1109/tsp.2021.3061575openalex-extracted
Graphon Filters: Graph Signal Processing in the Limit
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.