Evaluation of supervised and unsupervised 3D star visualisation algorithms
by Jahangheer Shaik; Mohammed Yeasin; David J. Russomanno
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 8, No. 4, 2013

Abstract: The 3D Star Coordinate Projection (3DSCP) visualisation algorithm has been developed to address the following key issues: 1) choosing the projection configuration autonomously; 2) preserving the data topology after projection; 3) enhancing resolution. A supervised version of 3DSCP (S3DSCP) is also introduced to improve the computational efficiency of 3DSCP. Comparison with other linear, non-linear and axis-based techniques is performed to illustrate the efficacy of the 3DSCP and S3DSCP methods. Empirical analyses indicate that the 3DSCP and S3DSCP algorithms find hidden patterns in data while overcoming limitations of other techniques.

Online publication date: Mon, 20-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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