2018
DOI: 10.1109/jsyst.2016.2576026
|View full text |Cite
|
Sign up to set email alerts
|

Local Similarity Imputation Based on Fast Clustering for Incomplete Data in Cyber-Physical Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(26 citation statements)
references
References 24 publications
0
26
0
Order By: Relevance
“…To use this algorithm, it is necessary to choose the optimal K and define a distance measurement between two observations. A local similarity imputation based on Fast Clustering was proposed in Zhao, Chen, Yang, Hu, and Obaidat (2018) . The authors partition the incomplete data with a fast clustering method (Stacked Autoencoder-based), then fill the missing data within each cluster using a KNN algorithm.…”
Section: Single Imputation Methodsmentioning
confidence: 99%
“…To use this algorithm, it is necessary to choose the optimal K and define a distance measurement between two observations. A local similarity imputation based on Fast Clustering was proposed in Zhao, Chen, Yang, Hu, and Obaidat (2018) . The authors partition the incomplete data with a fast clustering method (Stacked Autoencoder-based), then fill the missing data within each cluster using a KNN algorithm.…”
Section: Single Imputation Methodsmentioning
confidence: 99%
“…The evidence chain approach [24] was also applied to mine all relevant evidence of missing values and build the further estimation of missing values. Moreover, Zhao et al [25] developed a novel local similarity imputation method that estimates missing data based on fast clustering and top k-nearest neighbors, and in order to improve the imputation accuracy, a two-layer stacked autoencoder combined with distinctive imputation is applied to locate the principal features of a dataset for clustering. Tsai et al [26] introduced a class center based missing value imputation approach to produce effective imputation results more efficiently based on measuring the class center of each class and then the distances between it and the other observed data are used to define a threshold for the later imputation.…”
Section: Related Workmentioning
confidence: 99%
“…With a larger τ , the algorithm runs fast but the selected positions may have worse utilities; With a smaller τ , the algorithm runs slow but the selected positions have better utilities. We will consider using energy efficient clustering algorithms [20], [21], [22] to find the deployment positions in our future work.…”
Section: Algorithm 1 the Deployment Algorithm Inputmentioning
confidence: 99%