Data classification by parallel generation of set partitions Online publication date: Mon, 31-Mar-2014
by Hoang Chi Thanh
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 7, No. 2, 2013
Abstract: In this paper, we propose two data classification problems. As each crisp classification of a data object set is a partition of the set, so we apply our partition generation algorithm to the data classification problems. First, we recall our new simple algorithm generating partitions and parallelise it. Then we separate a data object set into classes by partitioning the set.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com