Skip to main content
Log in

New method of mining incomplete data

  • Published:
Journal of Electronics (China)

Abstract

The data used in the process of knowledge discovery often includes noise and incomplete information. The boundaries of different classes of these data are blur and unobvious. When these data are clustered or classified, we often get the coverings instead of the partitions, and it usually makes our information system insecure. In this paper, optimal partitioning of incomplete data is researched. Firstly, the relationship of set cover and set partition is discussed, and the distance between set cover and set partition is defined. Secondly, the optimal partitioning of given cover is researched by the combing and parting method, acquiring the optimal partition from three different partitions set family is discussed. Finally, the corresponding optimal algorithm is given. The real wireless signals offten contain a lot of noise, and there are many errors in boundaries when these data is clustered based on the tradional method. In our experimant, the proposed method improves correct rate greatly, and the experimental results demonstrate the method’s validity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. C. Vinod and Dr. M. Punithavalli. Classification of incomplete data handling techniques-an overview. International Journal on Computer Science and Engineering, 3(2011)1, 340–344.

    Google Scholar 

  2. Li Changqing, Li Kedian, and Li Jinjin. Extension of rough sets based on determinism of incomplete information systems and set-pair connection degree. Chinese Journal of Engineering Mathematics, 27(2010) 2, 343–346 (in Chinese). 李长清, 李克典, 李进金. 不完备信息系统确定性和集对联系度的粗集拓展模型. 工程数学学报, 27(2010)2, 343–346.

    Google Scholar 

  3. Xu Yi and Li Longshu. Variable precision rough set model based on(α, λ) connection degree tolerance relation. Acta Automatica Sinica, 37(2011)3, 303–307 (in Chinese). 徐怡, 李龙澍. 基于(α, λ) 联系度容差关系的变精度粗糙集模型. 自动化学报, 37(2011)3, 303–307.

    Article  MathSciNet  MATH  Google Scholar 

  4. Byron J. Gao, Martin Ester, and Jin-Yi Cai. The minimum consistent subset cover problem and its applications in data mining. Conference on Knowledge Discovery and Data Mining, 2007, San Jose, CA, USA, 310–319.

  5. Ludmila Himmelspach, Daniel Hommers, and Stefan Conrad. Cluster tendency assessment for fuzzy clustering of incomplete data. Proceedings of Wuropean Society for Fuzzy Logic and Technology, Aix-Les-Bains, France, 2011, 290–297.

  6. Matthias Templ, Andreas Alfons, and Peter Filzmoser. Exploring incomplete data using visualization techniques. Advances in Data Analysis and Classification, 2011, 29–47.

  7. Zhang Ling and Zhang Bo. Fuzzy tolerance quotient spaces and fuzzy subsets. Science China, Information Science, 41(2011)1, 1–11.

    Google Scholar 

  8. Wang Lunwen. Study of granular analysis in clustering. Computer Engineering and Application, (2006)5, 29–31 (in Chinese). 王伦文. 聚类的粒度分析. 计算机工程与应用, (2006)5, 29–31.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lin Zhang.

Additional information

Supported by the National Natural Science Foundation of China (No. 61273302) and partially by the Natural Science Foundation of Anhui Province (No. 1208085MF98, 1208085MF94).

Communication author: Wang Lunwen, born in 1966, male, Ph.D., Associate Professor.

About this article

Cite this article

Wang, L., Zhang, X., Wang, L. et al. New method of mining incomplete data. J. Electron.(China) 30, 411–416 (2013). https://doi.org/10.1007/s11767-013-3006-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11767-013-3006-5

Key words

CLC index

Navigation