On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.
Robert GanianIyad KanjSebastian OrdyniakStefan SzeiderPublished in: AAAI (2020)
Keyphrases
- incomplete data
- parameterized complexity
- missing values
- learning bayesian networks
- high dimensional data
- missing data
- bayesian networks
- k means
- incomplete data sets
- em algorithm
- clustering algorithm
- data points
- fixed parameter tractable
- principal component analysis
- high dimensional
- data sets
- low dimensional
- first order logic
- lower bound
- machine learning