File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Feature weighting by RELIEF based on local hyperplane approximation

TitleFeature weighting by RELIEF based on local hyperplane approximation
Authors
KeywordsRELIEF
local hyperplane
KNN
Feature weighting
Classification
Issue Date2012
PublisherSpringer.
Citation
16th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2012), Kuala Lumpur, Malaysia, 29 May - 1June 2012. In Advances in Knowledge Discovery and Data Mining: 16th Pacific-Asia Conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29 – June 1, 2012: Proceedings, Part II, 2012, p. 335-346 How to Cite?
AbstractIn this paper, we propose a new feature weighting algorithm through the classical RELIEF framework. The key idea is to estimate the feature weights through local approximation rather than global measurement, as used in previous methods. The weights obtained by our method are more robust to degradation of noisy features, even when the number of dimensions is huge. To demonstrate the performance of our method, we conduct experiments on classification by combining hyperplane KNN model (HKNN) and the proposed feature weight scheme. Empirical study on both synthetic and real-world data sets demonstrate the superior performance of the feature selection for supervised learning, and the effectiveness of our algorithm. © 2012 Springer-Verlag.
Persistent Identifierhttp://hdl.handle.net/10722/276919
ISBN
ISSN
2023 SCImago Journal Rankings: 0.606
Series/Report no.Lecture Notes in Computer Science ; 7302

 

DC FieldValueLanguage
dc.contributor.authorCai, Hongmin-
dc.contributor.authorNg, Michael-
dc.date.accessioned2019-09-18T08:35:03Z-
dc.date.available2019-09-18T08:35:03Z-
dc.date.issued2012-
dc.identifier.citation16th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2012), Kuala Lumpur, Malaysia, 29 May - 1June 2012. In Advances in Knowledge Discovery and Data Mining: 16th Pacific-Asia Conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29 – June 1, 2012: Proceedings, Part II, 2012, p. 335-346-
dc.identifier.isbn9783642302190-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/276919-
dc.description.abstractIn this paper, we propose a new feature weighting algorithm through the classical RELIEF framework. The key idea is to estimate the feature weights through local approximation rather than global measurement, as used in previous methods. The weights obtained by our method are more robust to degradation of noisy features, even when the number of dimensions is huge. To demonstrate the performance of our method, we conduct experiments on classification by combining hyperplane KNN model (HKNN) and the proposed feature weight scheme. Empirical study on both synthetic and real-world data sets demonstrate the superior performance of the feature selection for supervised learning, and the effectiveness of our algorithm. © 2012 Springer-Verlag.-
dc.languageeng-
dc.publisherSpringer.-
dc.relation.ispartofAdvances in Knowledge Discovery and Data Mining: 16th Pacific-Asia Conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29 – June 1, 2012: Proceedings, Part II-
dc.relation.ispartofseriesLecture Notes in Computer Science ; 7302-
dc.subjectRELIEF-
dc.subjectlocal hyperplane-
dc.subjectKNN-
dc.subjectFeature weighting-
dc.subjectClassification-
dc.titleFeature weighting by RELIEF based on local hyperplane approximation-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-30220-6_28-
dc.identifier.scopuseid_2-s2.0-84861444374-
dc.identifier.spage335-
dc.identifier.epage346-
dc.identifier.eissn1611-3349-
dc.publisher.placeBerlin-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats