This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Minimum Volume Covering Approach with a Set of Ellipsoids
Dec. 2013 (vol. 35 no. 12)
pp. 2997-3009
David Martinez-Rego, Dept. of Comput. Sci., Univ. of A Coruna, A Coruña, Spain
Enrique Castillo, Dept. of Appl. Math. & Comput. Sci., Univ. of Cantabria, Santander, Spain
Oscar Fontenla-Romero, Dept. of Comput. Sci., Univ. of A Coruna, A Coruña, Spain
Amparo Alonso-Betanzos, Dept. of Comput. Sci., Univ. of A Coruna, A Coruña, Spain
A technique for adjusting a minimum volume set of covering ellipsoids technique is elaborated. Solutions to this problem have potential application in one-class classification and clustering problems. Its main original features are: 1) It avoids the direct evaluation of determinants by using diagonalization properties of the involved matrices, 2) it identifies and removes outliers from the estimation process, 3) it avoids binary variables resulting from the combinatorial character of the assignment problem that are replaced by continuous variables in the range [0, 1], 4) the problem can be solved by a bilevel algorithm that in its first level determines the ellipsoids and in its second level reassigns the data points to ellipsoids and identifies outliers based on an algorithm that forces the Karush-Kuhn-Tucker conditions to be satisfied. Two theorems provide rigorous bases for the proposed methods. Finally, a set of examples of application in different fields is given to illustrate the power of the method and its practical performance.
Index Terms:
pattern clustering,combinatorial mathematics,computational geometry,data handling,determinants,matrix algebra,pattern classification,minimum volume covering approach,Karush-Kuhn-Tucker conditions,data point reassignment,bilevel algorithm,continuous variables,assignment problem,combinatorial character,binary variables,estimation process,outlier removal,outlier identification,matrices,diagonalization properties,determinant evaluation,clustering problem,one-class classification problem,covering ellipsoids technique,Ellipsoids,Volume measurements,Cluster approximation,Data models,Classification,minimum volume covering ellipsoids,One class classification,data clustering,bilevel algorithm
Citation:
David Martinez-Rego, Enrique Castillo, Oscar Fontenla-Romero, Amparo Alonso-Betanzos, "A Minimum Volume Covering Approach with a Set of Ellipsoids," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 12, pp. 2997-3009, Dec. 2013, doi:10.1109/TPAMI.2013.94
Usage of this product signifies your acceptance of the Terms of Use.