The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

Geometric Divide and Conquer Classification for High-dimensional DataTopics: Data Analytics; Data Modeling; Data Visualization; Datamining; Modeling and Managing Large Data Systems

Keyword(s):Classification, Divide and Conquer, Parallel Coordinates, Visualization.

Related
Ontology
Subjects/Areas/Topics:Artificial Intelligence
;
Biomedical Engineering
;
Business Analytics
;
Data Analytics
;
Data Engineering
;
Data Management and Quality
;
Data Manipulation
;
Data Mining
;
Data Modeling and Visualization
;
Data Visualization
;
Databases and Information Systems Integration
;
Datamining
;
Enterprise Information Systems
;
Health Information Systems
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Modeling and Managing Large Data Systems
;
Sensor Networks
;
Signal Processing
;
Soft Computing
;
Symbolic Systems

Abstract: From the Nested Cavities (abbr. NC) classifier (Inselberg and Avidan, 2000) a powerful new classification approach emerged. For a dataset P and a subset S ¼P the classifer constructs a rule distinguishing the elements of S from those in P.S. The NC is a geometrical algorithm which builds a sequence of nested unbounded parallelopipeds of minimal dimensionality containing disjoint subsets of P, and from which a hypersurface (the rule) containing the subset S is obtained. The partitioning of P.S and S into disjoint subsets is very useful when the original rule obtained is either too complex or imprecise. As illustrated with examples, this separation reveals exquisite insight on the datasetfs structure. Specifically from one of the problems we studied two different types of watermines were separated. From another dataset, two distinct types of ovarian cancer were found. This process is developed and illustrated on a (sonar) dataset with 60 variables and two categories (gminesh and grocksh) resulting in significant understanding of the domain and simplification of the classification rule. Such a situation is generic and occurs with other datasets as illustrated with a similar decompositions of a financial dataset producing two sets of conditions determing gold prices. The divide-and-conquer extension can be automated and also allows the classification of the sub-categories to be done in parallel.(More)

From the Nested Cavities (abbr. NC) classifier (Inselberg and Avidan, 2000) a powerful new classification approach emerged. For a dataset P and a subset S ¼P the classifer constructs a rule distinguishing the elements of S from those in P.S. The NC is a geometrical algorithm which builds a sequence of nested unbounded parallelopipeds of minimal dimensionality containing disjoint subsets of P, and from which a hypersurface (the rule) containing the subset S is obtained. The partitioning of P.S and S into disjoint subsets is very useful when the original rule obtained is either too complex or imprecise. As illustrated with examples, this separation reveals exquisite insight on the datasetfs structure. Specifically from one of the problems we studied two different types of watermines were separated. From another dataset, two distinct types of ovarian cancer were found. This process is developed and illustrated on a (sonar) dataset with 60 variables and two categories (gminesh and grocksh) resulting in significant understanding of the domain and simplification of the classification rule. Such a situation is generic and occurs with other datasets as illustrated with a similar decompositions of a financial dataset producing two sets of conditions determing gold prices. The divide-and-conquer extension can be automated and also allows the classification of the sub-categories to be done in parallel.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Ling Lai, P.; Jin Liang, Y. and Inselberg, A. (2012). Geometric Divide and Conquer Classification for High-dimensional Data.In Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA, ISBN 978-989-8565-18-1, pages 79-82. DOI: 10.5220/0004050600790082

@conference{data12, author={Pei Ling Lai. and Yang Jin Liang. and Alfred Inselberg.}, title={Geometric Divide and Conquer Classification for High-dimensional Data}, booktitle={Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA,}, year={2012}, pages={79-82}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0004050600790082}, isbn={978-989-8565-18-1}, }

TY - CONF

JO - Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA, TI - Geometric Divide and Conquer Classification for High-dimensional Data SN - 978-989-8565-18-1 AU - Ling Lai, P. AU - Jin Liang, Y. AU - Inselberg, A. PY - 2012 SP - 79 EP - 82 DO - 10.5220/0004050600790082