Data Imputation Methods and Technologies by Ritesh Kumar Pandey | Dr Asha Ambhaikar - International Journal of Trend in Scientific Research and Development

IJTSRD is a leading Open Access, Peer-Reviewed International Journal which provides rapid publication of your research articles and aims to promote the theory and practice along with knowledge sharing between researchers, developers, engineers, students, and practitioners working in and around the world in many areas. For any further information, feel free to write us on editor.ijtsrd@gmail.com

Wednesday, 16 May 2018

Data Imputation Methods and Technologies by Ritesh Kumar Pandey | Dr Asha Ambhaikar

We introduce a class of linear quantile regression estimators for panel data. Our framework contains dynamic auto regressive models, models with general predetermined regressors, and models with multiple individual e?ects as special cases. We follow a correlated random-e?ects approach, and rely on additional layers of quantile regressions as a flexible tool to model conditional distributions. Conditions are given under which the model is nonparametrically identified in static or Markovian dynamic models. We develop a sequential method-of-moment approach for estimation, and compute the estimator using an iterative algorithm that exploits the computational simplicity of ordinary quantile regression in each iteration step. 

Finally, a Monte-Carlo exercise and an application to measure the e?ect of smoking during pregnancy on children's birth weights complete the paper. K-means and K-medoids clustering algorithms are widely used for many practical applications. Original k-mean and k-medoids algorithms select initial centroids and medoids randomly that affect the quality of the resulting clusters and sometimes it generates unstable and empty clusters which are meaningless. The original k-means and k-mediods algorithm is computationally expensive and requires time proportional to the product of the number of data items, number of clusters and the number of iterations. 

The new approach for the k mean algorithm eliminates the deficiency of exiting k mean. It first calculates the initial centroids k as per requirements of users and then gives better, effective and stable cluster. It also takes less execution time because it eliminates unnecessary distance computation by using previous iteration. The new approach for k- medoids selects initial k medoids systematically based on initial centroids. It generates stable clusters to improve accuracy. 

By Ritesh Kumar Pandey | Dr Asha Ambhaikar" Data Imputation Methods and Technologies" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-4 , June 2018, 

URL: http://www.ijtsrd.com/papers/ijtsrd14113.pdf

Direct Link - http://www.ijtsrd.com/computer-science/real-time-computing/14113/data-imputation-methods-and-technologies/ritesh-kumar-pandey

indexed journal, peer reviewed international journal, open access journal of engineering

No comments:

Post a Comment

Ad