Name
Abstract | ||
|---|---|---|
Data mining involves useful knowledge discovery using a data matrix consisting of records and attributes or variables. Not all the attributes may be useful in knowledge discovery, as some of them may be redundant, irrelevant, noisy or even opposing. Furthermore, using all the attributes increases the complexity of solving the problem. The Minimum Attribute Subset Selection Problem (MASSP) has been studied for well over three decades and researchers have come up with several solutions In this paper a new technique is proposed for the MASSP based on the crossing minimization paradigm from the domain of graph drawing using biclustering. Biclustering is used to quickly identify those attributes that are significant in the data matrix. The attributes identified are then used to perform one-way clustering and generate pixelized visualization of the clustered results. Using the proposed technique on two real datasets has shown promising results. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-71027-1_4 | VIEW |
Keywords | Field | DocType |
minimization paradigm,data mining,global visualization,useful knowledge discovery,knowledge discovery,graph drawing,proposed technique,minimum attribute subset selection,automatic attribute selection,one-way clustering,new technique,data matrix,attribute selection | Graph drawing,Data mining,Feature selection,Visualization,Computer science,Minification,Artificial intelligence,Knowledge extraction,Biclustering,Data mining algorithm,Cluster analysis,Machine learning | Conference |
Volume | ISSN | Citations |
4370 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahsan Abdullah | 1 | 45 | 7.98 |
| Amir Hussain | 2 | 705 | 29.16 |