EIDBSCAN: An Extended Improving DBSCAN algorithm with sampling techniques Online publication date: Mon, 14-Dec-2009
by Cheng-Fa Tsai, Chun-Yi Sung
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 5, No. 1, 2010
Abstract: Cluster analysis in data mining and knowledge discovery is an essential business application. This investigation describes a new clustering approach named EIDBSCAN that extends expansion seed selection into a sampling-based DBSCAN clustering algorithm. Additionally, the proposed algorithm may reduce eight Marked Boundary Objects to add expansion seeds according to far centrifugal force, which increases coverage. Our experimental results reveal that the proposed EIDBSCAN yields more accurate clustering results. In addition, in all the cases we studied, the proposed approach has a lower execution time cost than several existing well-known approaches, such as DBSCAN, IDBSCAN and KIDBSCAN clustering algorithms.
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 Business Intelligence and Data Mining (IJBIDM):
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