search for: mahattan

...oints. Thus, the multivariate problem becomes a univariate one. Then the outlier in those max's will define the outlier of the point. My question is: 1. I don't know if using mahalanobis is proper or not since most clustering algorithms implemented in R (like pam or clara) use euclidean or mahattan. 2. Is there a way to get the mahalanobis distance matrix for any two rows of a dataframe or matrix? 3. My approach does allow a point belonging to more than one k-cluster. Is there similar algorithm in R or published? Thanks for any suggestions, weiwei -- Weiwei Shi, Ph.D "Did you always...