Learning partial-value variable associations

Nong Ye, Ting Yan Fok

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Existing machine learning and data mining techniques have difficulty in handling three characteristics of real-world data sets all together in a computationally efficient way: (1) different data types with both categorical data and numeric data, (2) different variable relations for different values of variables, and (3) unknown variable dependency. The Partial-Value Association Discovery (PVAD) algorithm handles these three characteristics of real-world data all together, and enables the discovery of partial-value and full-value variable associations as well as univariate and multivariate effects of variable values. This paper illustrates the PVAD algorithm using a small data set, and presents the new development of a computationally fast method to discover the longest associations with one conditional variable value or one associative variable value.

Original languageEnglish (US)
Title of host publicationICBDC 2019 - Proceedings of 2019 4th International Conference on Big Data and Computing
PublisherAssociation for Computing Machinery
Number of pages5
ISBN (Electronic)9781450362788
StatePublished - May 10 2019
Event4th International Conference on Big Data and Computing, ICBDC 2019 - Guangzhou, China
Duration: May 10 2019May 12 2019

Publication series

NameACM International Conference Proceeding Series


Conference4th International Conference on Big Data and Computing, ICBDC 2019


  • Data mining
  • Machine learning
  • Partial-value data association

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications


Dive into the research topics of 'Learning partial-value variable associations'. Together they form a unique fingerprint.

Cite this