FEATURE-PRESERVING CLUSTERING OF 2-D DATA FOR 2-CLASS PROBLEMS USING ANALYTICAL FORMULAS - AN AUTOMATIC AND FAST APPROACH

التفاصيل البيبلوغرافية
العنوان: FEATURE-PRESERVING CLUSTERING OF 2-D DATA FOR 2-CLASS PROBLEMS USING ANALYTICAL FORMULAS - AN AUTOMATIC AND FAST APPROACH
المؤلفون: LIN, JC, TSAI, WH
المساهمون: 交大名義發表, 資訊工程學系, National Chiao Tung University, Department of Computer Science
سنة النشر: 1994
المجموعة: National Chiao Tung University: NCTU Institutional Repository / 國立交通大學機構典藏
مصطلحات موضوعية: 2-CLASS CLUSTERING, CLUSTER REPRESENTATIVES, FEATURE-PRESERVING, ANALYTICAL FORMULAS, DECISION BOUNDARY, AUTOMATIC FAST CLUSTERING, K-MEANS, HIERARCHICAL METHODS
الوصف: We propose in this correspondence a new method to perform two-class clustering of 2-D data in a quick and, automatic way by preserving certain features of the input data. The method is analytical, deterministic, unsupervised, automatic, and noniterative. The computation time is of order n if the data size is n, and hence much faster than any other method which requires the computation of an n-by-n dissimilarity matrix. Furthermore, the proposed method does not have the trouble of guessing initial values. This new approach is thus more suitable for fast automatic hierarchical clustering or any other fields requiring fast automatic two-class clustering of 2-D data. The method can be extended to cluster data in higher dimensional space. A 3-D example is included.
نوع الوثيقة: manuscript
اللغة: English
تدمد: 0162-8828
Relation: http://dx.doi.org/10.1109/34.291439; http://hdl.handle.net/11536/2524; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; WOS:A1994NP14100014
DOI: 10.1109/34.291439
الاتاحة: http://hdl.handle.net/11536/2524
https://doi.org/10.1109/34.291439
رقم الانضمام: edsbas.DA2B6E7C
قاعدة البيانات: BASE
الوصف
تدمد:01628828
DOI:10.1109/34.291439