New Method of Discernibility Matrix Formation

Qing Quan Meng

doi:10.4028/www.scientific.net/AMR.765-767.477

Paper Titles

Lattice Boltzmann Method for Numerical Simulation of Circular Tube Forced Convection
p.460

Submarine Launching Anti-Surfaceship Missile Firepower Allocation and Optimization Based on Partheno-Genetic Algorithm
p.465

Decision Variables Selection of Aluminum Electrolytic Process Based on FNN and RM
p.469

A Novel Particle Swarm Optimal Algorithm Hybridized with Random Disturbance Term
p.473

New Method of Discernibility Matrix Formation
p.477

Simulating Polydisperse Ellipsoid Particles System
p.482

Clustering Algorithm Based on Improved Particle Swarm Optimization
p.486

An Improved BP Algorithm and its Application
p.489

Particle Matching Algorithm for 3D-PIV Based on Delaunay Triangulation
p.493

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 765-767New Method of Discernibility Matrix Formation

New Method of Discernibility Matrix Formation

Abstract:

Aiming at the defect of the discernibility matrix formation, the three-process space-time function is analyzed, and the method is put forward which corresponding new elements dont involve the formation of discernibility matrix or the existed element is deleted, that is the method of discernibility matrix minimum formation. The algorithm of formation is also given in the method, with which, the number of discernibility matrix element is decreased, the space of data is saved and the speed of data mining is increased. The superiority of the method in time-space is verified during the experiment.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

477-481

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.765-767.477

Citation:

Cite this paper

Online since:

September 2013

Authors:

Qing Quan Meng

Keywords:

Discernibility Matrix, Formation, New Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Pawlak,Z. Rough Set[J]．Internat.J. Comput. Inform. Sci，1982，11(5) , p.341.

Google Scholar

[2] Qingquan Meng, Canhua Mei. New Dependability of Attribute Sets[J]. Journal of Computer Applications，2007，（27）7, p.1748.

Google Scholar

[3] Qing Liu. Rough set and Rough reasoning [M]. Beijing: Science Press, 2001, p.40.

Google Scholar

[4] Chuanjian Yang, Hao Ge, Long-shu Li. Discernibility Matrix and Its Computing Core Method[J], Computer Engineering, 2010，(36)9, p.87.

Google Scholar

[5] Xiongfei Li, Jun Li. Data Mining and Knowledge Discovery [J]. Beijing: Higher Education Press, (2003).

Google Scholar

[6] Qingquan Meng, Wenlong XU. Rough sets application to diagnoses of Traditional Chinese Medicine[J]. Journal of Anhui University(Natural Sciences), 2006，(30)4, p.18.

Google Scholar

[7] Qingquan Meng, Chuanshan Jin, Canhua Mei, Xuegang Hu. Time-consuming Calculation of Discernibility Matrix Method[J]. Computer Engineering, 2009，(35)6, p.55.

Google Scholar