Abstract

Previous chapter Next chapter Full AccessProceedings Proceedings of the 2016 SIAM International Conference on Data Mining (SDM)Robust Unsupervised Feature Selection on Networked DataJundong Li, Xia Hu, Liang Wu, and Huan LiuJundong Li, Xia Hu, Liang Wu, and Huan Liupp.387 - 395Chapter DOI:https://doi.org/10.1137/1.9781611974348.44PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Feature selection has shown its effectiveness to prepare high-dimensional data for many data mining and machine learning tasks. Traditional feature selection algorithms are mainly based on the assumption that data instances are independent and identically distributed. However, this assumption is invalid in networked data since instances are not only associated with high dimensional features but also inherently interconnected with each other. In addition, obtaining label information for networked data is time consuming and labor intensive. Without label information to direct feature selection, it is difficult to assess the feature relevance. In contrast to the scarce label information, link information in networks are abundant and could help select relevant features. However, most networked data has a lot of noisy links, resulting in the feature selection algorithms to be less effective. To address the above mentioned issues, we propose a robust unsupervised feature selection framework NetFS for networked data, which embeds the latent representation learning into feature selection. Therefore, content information is able to help mitigate the negative effects from noisy links in learning latent representations, while good latent representations in turn can contribute to extract more meaningful features. In other words, both phases could cooperate and boost each other. Experimental results on real-world datasets demonstrate the effectiveness of the proposed framework. Previous chapter Next chapter RelatedDetails Published:2016eISBN:978-1-61197-434-8 https://doi.org/10.1137/1.9781611974348Book Series Name:ProceedingsBook Code:PRDT16Book Pages:1-867

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call