Algorithm implementations for relational data analysis
Data Mining (DM), as one main step in the process of knowledge discovery in databases (KDD), is a technique that deals with inputting prepared data, searching data with algorithms and then outputting patterns. There are many data mining techniques, such as classification, clustering, and so on. This...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/53208 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Data Mining (DM), as one main step in the process of knowledge discovery in databases (KDD), is a technique that deals with inputting prepared data, searching data with algorithms and then outputting patterns. There are many data mining techniques, such as classification, clustering, and so on. This work is devoted to implement a newly developed effective clustering algorithm for high-dimensional star-structured multi-type relational data mining. |
|---|