Booster in High Dimensional Data Classification
Journal: International Journal of Trend in Scientific Research and Development (Vol.2, No. 3)Publication Date: 2018-08-02
Authors : Paruchuri Geethika Voleti Prasanthi;
Page : 1186-1190
Keywords : high dimensional data classification; feature selection; stability; Q-statistic; Booster;
Abstract
Classification issues in high dimensional information with modest number of perceptions are ending up additional normal particularly in microarray data. The increasing measure of content data on the Internet pages influences the grouping analysis[1]. The content grouping is a great examination method utilized for dividing an enormous measure of data into groups. Henceforth, the significant issue that influences the content grouping method is the nearness uninformative and inadequate highlights in content reports. A wide class of boosting calculations can be translated as performing coordinate-wise angle drop to limit some potential capacity of the edges of an information set[1]. This paper proposes another assessment measure Q-measurement that joins the solidness of the chose highlight subset in expansion to the expectation precision. At that point we propose the Booster of a FS calculation that lifts the estimation of the Qstatistic of the calculation connected. Paruchuri Geethika | Voleti Prasanthi"Booster in High Dimensional Data Classification" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11368.pdf http://www.ijtsrd.com/computer-science/other/11368/booster-in-high-dimensional-data-classification/paruchuri-geethika
Other Latest Articles
- Adaptive Conflict Resolution Mechanism for Multi-party Privacy Conflicts Resolving in Social Media
- Availability and Internet Access in Homes through Bayesian Networks
- Payments Innovation
- 4G Wireless Technology
- An Efficient Reconstructing Routing Path in Dynamic and Large scale networks using Extensive hashing
Last modified: 2018-08-03 15:54:03