|
|
|
|
|
Deepesh Chugh, Himanshu Mittal, Amit Saxena, Ritu Chauhan, Eiad Yafi and Mukesh Prasad
Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature ...
ver más
|
|
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
In this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph...
ver más
|
|
|
|
|
|