<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Imputing Structured Missing Values in Spatial Data with Clustered Adversarial Matrix Factorization</dc:title><dc:creator>Wang, Qi</dc:creator><dc:corporate_author/><dc:editor/><dc:description>challenge
as it may introduce uncertainties into the data analysis.
Recent advances in matrix completion have shown competitive
imputation performance when applied to many real-world domains.
However, there are two major limitations when applying
matrix completion methods to spatial data. First, they make a
strong assumption that the entries are missing-at-random, which
may not hold for spatial data. Second, they may not effectively
utilize the underlying spatial structure of the data. To address
these limitations, this paper presents a novel clustered adversarial
matrix factorization method to explore and exploit the underlying
cluster structure of the spatial data in order to facilitate effective
imputation. The proposed method utilizes an adversarial network
to learn the joint probability distribution of the variables and
improve the imputation performance for the missing entries that
are not randomly sampled.</dc:description><dc:publisher/><dc:date>2018-09-28</dc:date><dc:nsf_par_id>10076360</dc:nsf_par_id><dc:journal_name>Proc of the 18th IEEE International Conference on Data Mining</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation/><dc:issn/><dc:isbn/><dc:doi>https://doi.org/</dc:doi><dcq:identifierAwardId>1638679</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>