메뉴 건너뛰기




Volumn 4585 LNAI, Issue , 2007, Pages 320-331

Fast discovery of minimal sets of attributes functionally determining a decision attribute

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA MINING; DECISION TABLES; OPTIMIZATION;

EID: 38049030695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73451-2_34     Document Type: Conference Paper
Times cited : (7)

References (20)
  • 2
    • 0001454571 scopus 로고
    • Dependency Structures of Data Based Relationships
    • Geneva, Switzerland, pp
    • Armstrong, W.W.: Dependency Structures of Data Based Relationships. In: Proc. of IFIP Congress. Geneva, Switzerland, pp. 580-583 (1974)
    • (1974) Proc. of IFIP Congress , pp. 580-583
    • Armstrong, W.W.1
  • 3
    • 0042656300 scopus 로고    scopus 로고
    • Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, 869, pp. 346-355. Springer, Heidelberg (1994)
    • Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 346-355. Springer, Heidelberg (1994)
  • 4
    • 38049007237 scopus 로고    scopus 로고
    • Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49-88. Physica- Verlag, Heidelberg (2000)
    • Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49-88. Physica- Verlag, Heidelberg (2000)
  • 5
    • 0345201769 scopus 로고    scopus 로고
    • TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
    • Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The. Computer Journal 42(2), 100-111 (1999)
    • (1999) The. Computer Journal , vol.42 , Issue.2 , pp. 100-111
    • Huhtala, Y.1    Karkkainen, J.2    Porkka, P.3    Toivonen, H.4
  • 6
    • 3142716545 scopus 로고    scopus 로고
    • Comparative study of feature subset selection techniques for machine learning tasks
    • Poland, pp
    • Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative study of feature subset selection techniques for machine learning tasks. In: Proc. of IIS, Malbork, Poland, pp. 68-77 (1998)
    • (1998) Proc. of IIS, Malbork , pp. 68-77
    • Jelonek, J.1    Krawiec, K.2    Stefanowski, J.3
  • 7
    • 0035156139 scopus 로고    scopus 로고
    • Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems
    • Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. Intl. Journal of Intelligent Systems 16(1), 105-120 (2001)
    • (2001) Intl. Journal of Intelligent Systems , vol.16 , Issue.1 , pp. 105-120
    • Kryszkiewicz, M.1
  • 8
    • 38049015917 scopus 로고    scopus 로고
    • Certain, Generalized Decision, and Membership Distribution Reducts versus Functional Dependencies in Incomplete Systems
    • RSEISP
    • Kryszkiewicz, M.: Certain, Generalized Decision, and Membership Distribution Reducts versus Functional Dependencies in Incomplete Systems. RSEISP, LNAI (2007)
    • (2007) LNAI
    • Kryszkiewicz, M.1
  • 9
    • 35048893752 scopus 로고    scopus 로고
    • Towards Scalable Algorithms for Discovering Rough Set Reducts. In: Peters, J.F., Skowron, A., Grzymala-Busse, J.W., Kostek, B.
    • Swiniarski, R.W, Szczuka, M, eds, Transactions on Rough Sets I. Journal Subline, Springer, Heidelberg
    • Kryszkiewicz, M., Cichon, K.: Towards Scalable Algorithms for Discovering Rough Set Reducts. In: Peters, J.F., Skowron, A., Grzymala-Busse, J.W., Kostek, B.., Swiniarski, R.W., Szczuka, M. (eds.) Transactions on Rough Sets I. Journal Subline, LNCS, vol. 3100, pp. 120-143. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3100 , pp. 120-143
    • Kryszkiewicz, M.1    Cichon, K.2
  • 10
    • 0343975288 scopus 로고    scopus 로고
    • Rough Set Theory in Very Large Databases
    • Lille, France
    • Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proc. of CESA IMACS, Lille, France, vol. 2, pp. 936-941 (1996)
    • (1996) Proc. of CESA IMACS , vol.2 , pp. 936-941
    • Lin, T.Y.1
  • 11
    • 84937428829 scopus 로고    scopus 로고
    • Efficient Discovery of Functional Dependencies and Armstrong Relations
    • Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Proc. of EDBT, pp. 350-364 (2000)
    • (2000) Proc. of EDBT , pp. 350-364
    • Lopes, S.1    Petit, J.-M.2    Lakhal, L.3
  • 12
    • 0002642616 scopus 로고    scopus 로고
    • Knowledge Discovery in Databases: Rough Set Approach
    • Prague
    • Nguyen, S.H., Skowron, A., Synak, P., Wroblewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proc. of IFSA, vol. 2, pp. 204-209, Prague, (1997)
    • (1997) Proc. of IFSA , vol.2 , pp. 204-209
    • Nguyen, S.H.1    Skowron, A.2    Synak, P.3    Wroblewski, J.4
  • 14
    • 77649292403 scopus 로고    scopus 로고
    • Discovering Classification Knowledge in Databases Using Rough Sets
    • KDD, pp
    • Shan, N., Ziarko, W., Hamilton, H.J., Cercone, N.: Discovering Classification Knowledge in Databases Using Rough Sets. In: Proc. of: KDD, pp. 271-274 (1996)
    • (1996) Proc. of , pp. 271-274
    • Shan, N.1    Ziarko, W.2    Hamilton, H.J.3    Cercone, N.4
  • 16
    • 0012606338 scopus 로고    scopus 로고
    • Approximate Reducts in Decision Tables
    • Granada, Spain
    • Slezak, D.: Approximate Reducts in Decision Tables. In: Proc. of IPMU, Granada, Spain, vol. 3, pp. 1159-1164 (1996)
    • (1996) Proc. of IPMU , vol.3 , pp. 1159-1164
    • Slezak, D.1
  • 17
    • 84947715066 scopus 로고    scopus 로고
    • Searching for Frequential Reducts in Decision Tables with Uncertain Objects
    • Warsaw, Springer, Heidelberg
    • Slezak, D.: Searching for Frequential Reducts in Decision Tables with Uncertain Objects. In: Proc. of RSCTC, Warsaw, 1998, pp. 52-59. Springer, Heidelberg (1998)
    • (1998) Proc. of RSCTC , pp. 52-59
    • Slezak, D.1
  • 20
    • 0001814311 scopus 로고
    • Finding Minimal Reducts Using Genetic Algorithms
    • September/October, Wrightsville Beach, NC, pp
    • Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proc. of JCIS, September/October 1995, Wrightsville Beach, NC, pp. 186-189 (1995)
    • (1995) Proc. of JCIS , pp. 186-189
    • Wroblewski, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.