메뉴 건너뛰기




Volumn 2637, Issue , 2003, Pages 411-422

A method for aggregating partitions, applications in K.D.D.

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; KNOWLEDGE ENGINEERING; PROBLEM SOLVING; SET THEORY; ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 7444258544     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-36175-8_41     Document Type: Conference Paper
Times cited : (2)

References (6)
  • 2
    • 0024717601 scopus 로고
    • A cutting plane algorithm for a clustering problem
    • Grötschel, M., Wakabayashi, Y.: A Cutting Plane Algorithm for a Clustering Problem. in Mathematical Programming, Vol. 45. (1989) 59-96
    • (1989) Mathematical Programming , vol.45 , pp. 59-96
    • Grötschel, M.1    Wakabayashi, Y.2
  • 4
    • 0035514007 scopus 로고    scopus 로고
    • Resampling method for unsupervised estimation of cluster validity
    • Levine, E., Domany, E.: Resampling Method for Unsupervised Estimation of Cluster Validity. in Neural Computation, Vol. 13. (2001) 2573-2593
    • (2001) Neural Computation , vol.13 , pp. 2573-2593
    • Levine, E.1    Domany, E.2
  • 6
    • 26944434513 scopus 로고    scopus 로고
    • An optimisation model for aggregating preferences: A simulated annealing approach
    • Hermes
    • Nicoloyannis, N., Terrenoire, M., Tounissoux, D.: An Optimisation Model for Aggregating Preferences: A Simulated Annealing Approach. in Health and System Science, Vol. 2. Hermes (1998) 33-44
    • (1998) Health and System Science , vol.2 , pp. 33-44
    • Nicoloyannis, N.1    Terrenoire, M.2    Tounissoux, D.3


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