Author:
Gowda V. Dankan,Sharma Avinash,Kumaraswamy S.,Sarma Parismita,Hussain Naziya,Dixit Santosh Kumar,Gupta Anand Kumar
Abstract
An major constraint in the realm of feature selection is that users choose the ideal number of characteristics that must be picked. In this article, an effort is made to automate the process of determining a suitable value for the appropriate the quantity of characteristics that must be chosen for better recognition tasks. To estimate the ideal amount of features that should be maintained for properly describing the data, we use the dense subgraph discovery approach for this goal. Notably, the existing methods uses a similar kind of approach called the dense subgraph finding. But the earlier approach obtains a single dense subgraph, while the task of dense subgraphs finding obtains a number of dense subgraphs that are important for learning the internal structure of any network. Thus, dense subgraphs finding is likely to be adopted as a natural choice for realizing the complex relations among the nodes of massive real-life networks, such as biological networks, social networks.
Subject
Applied Mathematics,Analysis
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Advanced Machine Learning Approaches to Evaluate User Feedback on Virtual Assistants for System Optimization;2024 2nd International Conference on Sustainable Computing and Smart Systems (ICSCSS);2024-07-10
2. Real-Time Health Data Analytics in IoT-Connected Wearable Devices;2024 5th International Conference for Emerging Technology (INCET);2024-05-24
3. Scaling Robot Intelligence With Cloud-Based Cloning Platforms;Advances in Computational Intelligence and Robotics;2024-04-26
4. Robotic Evolution Integrating IoT and Robots;Advances in Computational Intelligence and Robotics;2024-04-26
5. Cloud Robotics and the Power of Application Offloading Strategies;Advances in Computational Intelligence and Robotics;2024-04-26