2018
DOI: 10.1016/j.eij.2018.03.003
|View full text |Cite
|
Sign up to set email alerts
|

A contemporary feature selection and classification framework for imbalanced biomedical datasets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
3
1

Relationship

2
8

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 12 publications
0
14
0
Order By: Relevance
“…We tend to actualize a brimming with life discovering administration with SITINA on Face book to approve our arrangement [19]. The impact of any seed set is characterized dependent on the data dispersion process among the clients the data dissemination is viral promoting, where an organization may wish to spread the reception of another item from some underlying adopters through the social connections between clients [20].…”
Section: Figure 2 Group Of Social Usersmentioning
confidence: 99%
“…We tend to actualize a brimming with life discovering administration with SITINA on Face book to approve our arrangement [19]. The impact of any seed set is characterized dependent on the data dispersion process among the clients the data dissemination is viral promoting, where an organization may wish to spread the reception of another item from some underlying adopters through the social connections between clients [20].…”
Section: Figure 2 Group Of Social Usersmentioning
confidence: 99%
“…Notwithstanding, a fairly organized picture of clustering approaches can be given. The key fundamental clustering approaches can generally be classified, as shown in Table-1, to the following approaches [17,22]: Table 1-Clustering methods of data in a general perspective [18] Method General Characteristics Partitioning methods -Finds mutually exclusive clusters of spherical shape -Distance based -May use mean or medoid (etc.) to represent cluster center -Effective for small to medium size data sets Hierarchical methods -Clustering is a hierarchical decomposition (i.e., multiple levels) -Cannot correct erroneous merges or splits -May incorporate other techniques like microclustering or consider object "linkages" Density based methods -Can find arbitrarily shaped clusters -Clusters are dense regions of objects in space that are separated by low density regions -Cluster density: Each point must have a minimum number of points within its "neighborhood" -May filter out outliers Grid based methods -Use a multiresolution grid data structure -Fast processing time (typically independent of the number of data objects, yet dependent on grid size) Hierarchical techniques: these techniques integrate data objects into subgroups, which are incorporated into larger and higher-level groups, and the process continues in this manner to formulate a hierarchical tree.…”
Section: Clusteringmentioning
confidence: 99%
“…It is wholly based on feature similarity of the majority vote of neighbours. A given data point is assigned to that class, which has most common among its k nearest neighbours [16].…”
Section: K-nearest Neighboursmentioning
confidence: 99%