(Enter summary)
Abstract: We propose a new approach for using online competitive learning on
binary data. The usual Euclidean distance is replaced by binary distance
measures, which take possible asymmetries of binary data into account
and therefore provide a "different point of view" for looking at the data.
The method is demonstrated on two artificial examples and applied on
tourist marketing research data.
1 Introduction
Most common clustering methods such as k-means, (hard and soft) competitive
learning or neural... (Update)
Context of citations to this paper: More
...2. 2 Hard Competitive Learning with Binary Distance Measure Another modi cation of a standard cluster algorithm is proposed by Leisch et al. 1998). They take hard competitive learning as base algorithm and replace the usual symmetric distances such as Euclidean or absolute...
...then the correct cluster centers are the respective medians. Recently several extensions to non Euclidean distances have been proposed [5], 6] Popular partitioning algorithms include classic methods like the k means algorithm and its online variants (which are often...
Cited by: More
Bagged Clustering - Leisch (1999)
(Correct)
A Comparison of Several Cluster Algorithms on.. - Dolnicar, Leisch, .. (1998)
(Correct)
Similar documents (at the sentence level):
72.1%: Competitive Learning for Binary Valued Data - Leisch, Weingessel, Dimitriadou (1998)
(Correct)
Active bibliography (related documents): More All
0.0: Estimation of Software Reliability by Stratified Sampling - Podgurski, Masri.. (1999)
(Correct)
0.0: C.2 LANDSAT Imaging Project - In The First
(Correct)
0.0: Scaling EM (Expectation-Maximization) Clustering to Large.. - Bradley, Fayyad, Reina (1999)
(Correct)
Similar documents based on text: More All
0.9: A Mixed Ensemble Approach for the Semi-Supervised Problem - Dimitriadou, Weingessel..
(Correct)
0.7: A Simulation Framework for Heterogeneous Agents - Meyer, Buchta, Karatzoglou.. (2002)
(Correct)
0.6: Generalized M-Fluctuation Tests for Parameter Instability - Zeileis, Hornik
(Correct)
Related documents from co-citation: More All
2: in Advances in Neural Information Processing Systems (context) - Weinshall, Jacobs et al. - 1999
BibTeX entry: (Update)
Leisch, F., Weingessel, A., & Dimitriadou, E. (1998). Competitive learning for binary valued data. In Niklasson, L., Boden, M., & Ziemke, T. (eds.), Proceedings of the 8th International Conference on Articial Neural Networks (ICANN 98), vol. 2, pp. 779-784, Skovde, Sweden. http://citeseer.comp.nus.edu.sg/24194.html More
@misc{ leisch98competitive,
author = "F. Leisch and A. Weingessel and E. Dimitriadou",
title = "Competitive learning for binary valued data",
text = "Leisch, F., Weingessel, A., & Dimitriadou, E. (1998). Competitive learning
for binary valued data. In Niklasson, L., Boden, M., & Ziemke, T. (eds.),
Proceedings of the 8th International Conference on Articial Neural Networks
(ICANN 98), vol. 2, pp. 779-784, Skovde, Sweden.",
year = "1998",
url = "citeseer.comp.nus.edu.sg/24194.html" }
Citations (may not include all citations):
490
Pattern recognition and Neural networks
- Ripley - 1996
197
Cluster analysis for applications (context) - Anderberg - 1973
77
Finding Groups in Data (context) - Kaufman, Rousseeuw - 1990
1
Adaptive Information Systems and Modeling in Economics and M.. (context) - of, Algorithms et al. - 1997
Documents on the same site (http://www.wu-wien.ac.at/am/reports.html): More
A Tale of Three Cities: Perceptual Charting for.. - Dolnicar, Grabler.. (1998)
(Correct)
Combined Market Structure and Segmentation Analysis Based on.. - Reutterer (1998)
(Correct)
Volatility Prediction with Mixture Density Networks - Schittenkopf, Dorffner.. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.