Clustering ellipses for anomaly detection

DOI10.1016/J.PATCOG.2010.07.024zbMath1207.68301OpenAlexW2116210667MaRDI QIDQ609173

Marimuthu Palaniswami, James M. Keller, Sutharshan Rajasegarar, Timothy C. Havens, Laurence Park, Masud Moshtaghi, Christopher Leckie, James C. Bezdek

Publication date: 30 November 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2010.07.024

zbMATH Keywords

cluster analysiselliptical anomalies in wireless sensor networksreordered dissimilarity imagessimilarity of ellipsoidssingle linkage clusteringvisual assessment

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (3)

Clustering ellipses for anomaly detection ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.

Cites Work

• Clustering ellipses for anomaly detection
• On the characteristic values of non-symmetric block random matrices
• Ellipsoidal decision regions for motif-based patterned fabric defect detection
• Is VAT really single linkage in disguise?
• Scalable visual assessment of cluster tendency for large data sets
• Estimating Number of Clusters Based on a General Similarity Matrix with Application to Microarray Data
• Clustering in ordered dissimilarity data
• Printer graphics for clustering
• Trust Region Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clustering ellipses for anomaly detection