A Feature Selection Algorithm in Online Stream Dataset Based on Multivariate Mutual Information

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RAHMANINIA M.; MORADI P.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2021 | Volume:18 | Issue:4 Page(s): 327-336

Download Full-Text

Persian Verion

View:

384

Download:

Cites:

Information Journal Paper

Title

A Feature Selection Algorithm in Online Stream Dataset Based on Multivariate Mutual Information

Author(s)

RAHMANINIA M. | MORADI P. | Issue Writer Certificate

Keywords

Feature selectionQ1

online stream datasetQ1

mutual informationQ2

joint random variablesQ1

Abstract

Today, in many real-world applications, such as social networks, we are faced with data streams which new data is appeared every moment. Since the efficiency of most data mining algorithms decreases with increasing data dimensions, analysis of the data has become one of the most important issues recently. Online stream Feature selection is an effective approach which aims at removing those of redundant features and keeping relevant ones, leads to reduce the size of the data and improve the accuracy of the online data mining methods. There are several critical issues for online stream Feature selection methods including: unavailability of the entire feature set before starting the algorithm, scalability, stability, classification accuracy, and size of selected feature set. So far, existing methods have only been able to address a few numbers of these issues simultaneously. To this end, in this paper, we present an online Feature selection method called MMIOSFS that provides a better tradeoff between these challenges using mutual information. In the proposed method, first the feature set is mapped to a new feature using joint random variables technique, then the mutual information of new feature with the class label is computed as the degree of relationship between the features set. The efficiency of the proposed method was compared to several online Feature selection algorithms based on different categories. The results show that the proposed method usually achieves better tradeoff between the mentioned challenges.

Cites

No record.

References

No record.

Cite

APA: Copy

RAHMANINIA, M., & MORADI, P.. (2021). A Feature Selection Algorithm in Online Stream Dataset Based on Multivariate Mutual Information. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 18(4 ), 327-336. SID. https://sid.ir/paper/386050/en

Vancouver: Copy

RAHMANINIA M., MORADI P.. A Feature Selection Algorithm in Online Stream Dataset Based on Multivariate Mutual Information. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2021;18(4 ):327-336. Available from: https://sid.ir/paper/386050/en

IEEE: Copy

M. RAHMANINIA, and P. MORADI, “A Feature Selection Algorithm in Online Stream Dataset Based on Multivariate Mutual Information,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 18, no. 4 , pp. 327–336, 2021, [Online]. Available: https://sid.ir/paper/386050/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops