TL;DR
FRANe is an unsupervised feature ranking algorithm that uses attribute networks to identify key features in unlabeled data, outperforming existing methods and providing interpretable results.
Contribution
The paper introduces FRANe, a novel unsupervised feature ranking method based on network analysis, with demonstrated scalability and superior performance.
Findings
FRANe outperforms state-of-the-art competitors on benchmark datasets.
FRANe provides interpretable relational structures for feature importance.
FRANe has scalable time complexity analysis.
Abstract
The need for learning from unlabeled data is increasing in contemporary machine learning. Methods for unsupervised feature ranking, which identify the most important features in such data are thus gaining attention, and so are their applications in studying high throughput biological experiments or user bases for recommender systems. We propose FRANe (Feature Ranking via Attribute Networks), an unsupervised algorithm capable of finding key features in given unlabeled data set. FRANe is based on ideas from network reconstruction and network analysis. FRANe performs better than state-of-the-art competitors, as we empirically demonstrate on a large collection of benchmarks. Moreover, we provide the time complexity analysis of FRANe further demonstrating its scalability. Finally, FRANe offers as the result the interpretable relational structures used to derive the feature importances.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
