Clustering ellipses for anomaly detection
DOI10.1016/J.PATCOG.2010.07.024zbMATH Open1207.68301OpenAlexW2116210667MaRDI QIDQ609173FDOQ609173
Authors: Masud Moshtaghi, Timothy C. Havens, James C. Bezdek, Laurence Park, Christopher Leckie, Sutharshan Rajasegarar, James M. Keller, Marimuthu Palaniswami
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
Recommendations
cluster analysiselliptical anomalies in wireless sensor networksreordered dissimilarity imagessimilarity of ellipsoidssingle linkage clusteringvisual assessment
Cites Work
- Title not available (Why is that?)
- Printer graphics for clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trust Region Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
Cited In (3)
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Clustering ellipses for anomaly detection
- 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.
This page was built for publication: Clustering ellipses for anomaly detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609173)