The k-Nearest Neighbor estimation of the conditional mode function for functional data under dependency
We focus in this paper to the estimation of the conditional mode by the k-Nearest Neighbors method (shortly k-NN).We give asymptotic results of the k-NN conditional mode estimation: the almost complete convergence and its rate under strongly mixing dependence condition. To exhibit the effectiveness of this estimation method compared to the classical kernel method estimation a real data application is given.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.