Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

HIREL : an incremental clustering algorithm for relational datasets

Tools
- Tools
+ Tools

Tao, Lei and Anand, Sarabjot Singh (2008) HIREL : an incremental clustering algorithm for relational datasets. In: ICDM '08. Data Mining, 2008. Eighth IEEE International Conference, Pisa, Italy, 15-19 Dec 2008. Published in: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM'08) pp. 887-892. ISBN 9780769535029. doi:10.1109/ICDM.2008.116 ISSN 1550-4786.

[img] PDF
hirel.pdf - Published Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (333Kb)
Official URL: http://dx.doi.org/10.1109/ICDM.2008.116

Request Changes to record.

Abstract

Traditional clustering approaches usually analyze static datasets in which objects are kept unchanged after being processed, but many practical datasets are dynamically modified which means some previously learned patterns have to be updated accordingly. Re-clustering the whole dataset from scratch is not a good choice due to the frequent data modifications and the limited out-of-service time, so the development of incremental clustering approaches is highly desirable. Besides that, propositional clustering algorithms are not suitable for relational datasets because of their quadratic computational complexity. In this paper, we propose an incremental clustering algorithm that requires only one pass of the relational dataset. The utilization of the Representative Objects and the balanced Search Tree greatly accelerate the learning procedure. Experimental results prove the effectiveness of our algorithm.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM'08)
Publisher: IEEE Computer Society
ISBN: 9780769535029
ISSN: 1550-4786
Official Date: 2008
Dates:
DateEvent
2008Published
Page Range: pp. 887-892
DOI: 10.1109/ICDM.2008.116
Status: Peer Reviewed
Publication Status: Published
Date of first compliant deposit: 21 December 2015
Conference Paper Type: Paper
Title of Event: ICDM '08. Data Mining, 2008. Eighth IEEE International Conference
Type of Event: Conference
Location of Event: Pisa, Italy
Date(s) of Event: 15-19 Dec 2008

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us