Skip to main content
Erschienen in: Soft Computing 12/2016

11.07.2015 | Methodologies and Application

Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model

verfasst von: Anjing Fan, Hong Zhao, William Zhu

Erschienen in: Soft Computing | Ausgabe 12/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Test-cost-sensitive attribute reduction is an important component in data mining applications, and plays a key role in cost-sensitive learning. Some previous approaches in test-cost-sensitive attribute reduction focus mainly on homogeneous datasets. When heterogeneous datasets must be taken into account, the previous approaches convert nominal attribute to numerical attribute directly. In this paper, we introduce an adaptive neighborhood model for heterogeneous attribute and deal with test-cost-sensitive attribute reduction problem. In the adaptive neighborhood model, the objects with numerical attributes are dealt with classical covering neighborhood, and the objects with nominal attributes are dealt with the overlap metric neighborhood. Compared with the previous approaches, the proposed model can avoid that objects with different values of nominal attribute are classified into one neighborhood. The number of inconsistent objects of a neighborhood reflects the discriminating capability of an attribute subset. With the adaptive neighborhood model, an inconsistent objects-based heuristic reduction algorithm is constructed. The proposed algorithm is compared with the \(\lambda \)-weighted heuristic reduction algorithm which nominal attribute is normalized. Experimental results demonstrate that the proposed algorithm is more effective and more practical significance than the \(\lambda \)-weighted heuristic reduction algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Andersen TL, Martinez TR (1995) Np-completeness of minimum rule sets. In: Proceedings of the 10th international symposium on computer and information sciences, Citeseer Andersen TL, Martinez TR (1995) Np-completeness of minimum rule sets. In: Proceedings of the 10th international symposium on computer and information sciences, Citeseer
Zurück zum Zitat Bianchi FM, Livi L, Rizzi A, Sadeghian A (2014) A granular computing approach to the design of optimized graph classification systems. Soft Comput 18(2):393–412CrossRef Bianchi FM, Livi L, Rizzi A, Sadeghian A (2014) A granular computing approach to the design of optimized graph classification systems. Soft Comput 18(2):393–412CrossRef
Zurück zum Zitat Hu QH, Yu DR, Xie Z (2008a) Neighborhood classifiers. Expert Syst Appl 34(2):866–876 Hu QH, Yu DR, Xie Z (2008a) Neighborhood classifiers. Expert Syst Appl 34(2):866–876
Zurück zum Zitat Hu QH, Yu DR, Liu JF, Wu C (2008b) Neighborhood rough set based heterogeneous feature subset selection. Inf Sci 178(18):3577–3594 Hu QH, Yu DR, Liu JF, Wu C (2008b) Neighborhood rough set based heterogeneous feature subset selection. Inf Sci 178(18):3577–3594
Zurück zum Zitat Hunt EB, Marin J, Stone PJ (1966) Experiments in induction. Academic press, New York Hunt EB, Marin J, Stone PJ (1966) Experiments in induction. Academic press, New York
Zurück zum Zitat Ji S, Carin L (2007) Cost-sensitive feature acquisition and classification. Pattern Recognit 40:1474–1485CrossRefMATH Ji S, Carin L (2007) Cost-sensitive feature acquisition and classification. Pattern Recognit 40:1474–1485CrossRefMATH
Zurück zum Zitat Jia X, Liao W, Tang Z, Shang L (2013) Minimum cost attribute reduction in decision-theoretic rough set models. Inf Sci 219:151–167CrossRefMATHMathSciNet Jia X, Liao W, Tang Z, Shang L (2013) Minimum cost attribute reduction in decision-theoretic rough set models. Inf Sci 219:151–167CrossRefMATHMathSciNet
Zurück zum Zitat Jing SY (2014) A hybrid genetic algorithm for feature subset selection in rough set theory. Soft Comput 18(7):1373–1382CrossRef Jing SY (2014) A hybrid genetic algorithm for feature subset selection in rough set theory. Soft Comput 18(7):1373–1382CrossRef
Zurück zum Zitat Lanzi P (1997) Fast feature selection with genetic algorithms: a filter approach. In: Evolutionary computation Lanzi P (1997) Fast feature selection with genetic algorithms: a filter approach. In: Evolutionary computation
Zurück zum Zitat Lavrac N, Gamberger D, Turney P (1996) Cost-sensitive feature reduction applied to a hybrid genetic algorithm. In: Proceedings of the 7th international workshop on algorithmic learning theory, ALT Lavrac N, Gamberger D, Turney P (1996) Cost-sensitive feature reduction applied to a hybrid genetic algorithm. In: Proceedings of the 7th international workshop on algorithmic learning theory, ALT
Zurück zum Zitat Li JH, Mei CL, Xu WH, Qian YH (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467CrossRefMathSciNet Li JH, Mei CL, Xu WH, Qian YH (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467CrossRefMathSciNet
Zurück zum Zitat Lin TY (1998) Granular computing on binary relations: data mining and neighborhood systems. In: Rough sets in knowledge discovery Lin TY (1998) Granular computing on binary relations: data mining and neighborhood systems. In: Rough sets in knowledge discovery
Zurück zum Zitat Lin TY (2002) Granular computing on binary relations-analysis of conflict and Chinese wall security policy. Proc Rough Sets Curr Trends Comput 2475:296–299CrossRef Lin TY (2002) Granular computing on binary relations-analysis of conflict and Chinese wall security policy. Proc Rough Sets Curr Trends Comput 2475:296–299CrossRef
Zurück zum Zitat Lin TY (2003) Granular computing–structures, representations, and applications. Lect Notes Artif Intell 2639:16–24 Lin TY (2003) Granular computing–structures, representations, and applications. Lect Notes Artif Intell 2639:16–24
Zurück zum Zitat Miao DQ, Zhao Y, Yao YY, Li H, Xu F (2009) Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Inf Sci 179(24):4140–4150CrossRefMATHMathSciNet Miao DQ, Zhao Y, Yao YY, Li H, Xu F (2009) Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Inf Sci 179(24):4140–4150CrossRefMATHMathSciNet
Zurück zum Zitat Min F, He HP, Qian YH, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928–4942CrossRef Min F, He HP, Qian YH, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928–4942CrossRef
Zurück zum Zitat Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, BostonCrossRefMATH Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, BostonCrossRefMATH
Zurück zum Zitat Pazzani M, Merz C, Ali PMK, Hume T, Brunk C (1994) Reducing misclassification costs. In: Proceedings of the 11th international conference of machine learning (ICML), Morgan Kaufmann Pazzani M, Merz C, Ali PMK, Hume T, Brunk C (1994) Reducing misclassification costs. In: Proceedings of the 11th international conference of machine learning (ICML), Morgan Kaufmann
Zurück zum Zitat Qian J, Lv P, Yue X, Liu C, Jing Z (2015) Hierarchical attribute reduction algorithms for big data using mapreduce. Knowl Based Syst 73:18–31CrossRef Qian J, Lv P, Yue X, Liu C, Jing Z (2015) Hierarchical attribute reduction algorithms for big data using mapreduce. Knowl Based Syst 73:18–31CrossRef
Zurück zum Zitat Sanchez MA, Castillo O, Castro JR, Melin P (2014) Fuzzy granular gravitational clustering algorithm for multivariate data. Inf Sci 279:498–511CrossRefMathSciNet Sanchez MA, Castillo O, Castro JR, Melin P (2014) Fuzzy granular gravitational clustering algorithm for multivariate data. Inf Sci 279:498–511CrossRefMathSciNet
Zurück zum Zitat Sanchez MA, Castillo O, Castro JR (2015) Information granule formation via the concept of uncertainty-based information with interval type-2 fuzzy sets representation and Takagi-Sugeno-Kang consequents optimized with cuckoo search. Appl Soft Comput 27:602–609CrossRef Sanchez MA, Castillo O, Castro JR (2015) Information granule formation via the concept of uncertainty-based information with interval type-2 fuzzy sets representation and Takagi-Sugeno-Kang consequents optimized with cuckoo search. Appl Soft Comput 27:602–609CrossRef
Zurück zum Zitat Susmaga R (1999) Computation of minimal cost reducts. In: Ras Z, Skowron A (eds) Foundations of intelligent systems, vol 1609, pp 448–456 Susmaga R (1999) Computation of minimal cost reducts. In: Ras Z, Skowron A (eds) Foundations of intelligent systems, vol 1609, pp 448–456
Zurück zum Zitat Tseng TLB, Huang CC (2007) Rough set-based approach to feature selection in customer relationship management. Omega 35(4):365–383CrossRef Tseng TLB, Huang CC (2007) Rough set-based approach to feature selection in customer relationship management. Omega 35(4):365–383CrossRef
Zurück zum Zitat Weiss Y, Elovici Y, Rokach L (2013) The cash algorithm-cost-sensitive attribute selection using histograms. Inf Sci 222:247–268CrossRefMathSciNet Weiss Y, Elovici Y, Rokach L (2013) The cash algorithm-cost-sensitive attribute selection using histograms. Inf Sci 222:247–268CrossRefMathSciNet
Zurück zum Zitat Yang XB, Yu DJ, Yang JY, Song XN (2009) Difference relation-based rough set and negative rules in incomplete information system. Int J Uncertain Fuzziness Knowl Based Syst 17(05):649–665CrossRefMATHMathSciNet Yang XB, Yu DJ, Yang JY, Song XN (2009) Difference relation-based rough set and negative rules in incomplete information system. Int J Uncertain Fuzziness Knowl Based Syst 17(05):649–665CrossRefMATHMathSciNet
Zurück zum Zitat Yao YY (2000) Information tables with neighborhood semantics. In: AeroSense 2000, international society for optics and photonics Yao YY (2000) Information tables with neighborhood semantics. In: AeroSense 2000, international society for optics and photonics
Zurück zum Zitat Yao YY (2004) A partition model of granular computing. Lecture Notes in Computer Science, vol. 3100, pp 232–253 Yao YY (2004) A partition model of granular computing. Lecture Notes in Computer Science, vol. 3100, pp 232–253
Zurück zum Zitat Yao YY, Zhong N (2002) Granular computing using information tables. In: Data mining, rough sets and granular computing, pp 102–124 Yao YY, Zhong N (2002) Granular computing using information tables. In: Data mining, rough sets and granular computing, pp 102–124
Zurück zum Zitat Zhang X, Mei C, Chen D, Li J (2013) Multi-confidence rule acquisition oriented attribute reduction of covering decision systems via combinatorial optimization. Knowl Based Syst 50:187–197CrossRef Zhang X, Mei C, Chen D, Li J (2013) Multi-confidence rule acquisition oriented attribute reduction of covering decision systems via combinatorial optimization. Knowl Based Syst 50:187–197CrossRef
Zurück zum Zitat Zhang X, Mei C, Chen D, Li J (2014) Multi-confidence rule acquisition and confidence-preserved attribute reduction in interval-valued decision systems. Int J Approx Reason 55(8):1787–1804CrossRefMATHMathSciNet Zhang X, Mei C, Chen D, Li J (2014) Multi-confidence rule acquisition and confidence-preserved attribute reduction in interval-valued decision systems. Int J Approx Reason 55(8):1787–1804CrossRefMATHMathSciNet
Zurück zum Zitat Zhao H, Zhu W (2014) Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl Based Syst 65:72–82CrossRef Zhao H, Zhu W (2014) Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl Based Syst 65:72–82CrossRef
Zurück zum Zitat Zhao H, Min F, Zhu W (2011) Test-cost-sensitive attribute reduction based on neighborhood rough set. In: Proceedings of the 2011 IEEE international conference on granular computing Zhao H, Min F, Zhu W (2011) Test-cost-sensitive attribute reduction based on neighborhood rough set. In: Proceedings of the 2011 IEEE international conference on granular computing
Zurück zum Zitat Zhong N, Dong JZ, Ohsuga S (2001) Using rough sets with heuristics to feature selection. J Intell Inf Syst 16(3):199–214CrossRefMATH Zhong N, Dong JZ, Ohsuga S (2001) Using rough sets with heuristics to feature selection. J Intell Inf Syst 16(3):199–214CrossRefMATH
Zurück zum Zitat Zhu W, Wang F (2003) Reduction and axiomatization of covering generalized rough sets. Inf Sci 152(1):217–230CrossRefMATH Zhu W, Wang F (2003) Reduction and axiomatization of covering generalized rough sets. Inf Sci 152(1):217–230CrossRefMATH
Metadaten
Titel
Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
verfasst von
Anjing Fan
Hong Zhao
William Zhu
Publikationsdatum
11.07.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 12/2016
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-015-1770-x

Weitere Artikel der Ausgabe 12/2016

Soft Computing 12/2016 Zur Ausgabe