NDLI: Second Attribute Algorithm Based on Tree Expression

Content Provider	Springer Nature Link
Author	Han, Su Qing Wang, Jue
Copyright Year	2006
Abstract	One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of finding personalized solutions can be transformed into computing the reduct on an attribute order. The second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order. An algorithm is implied based on the second attribute theorem, with computation on the discernibility matrix. Its time complexity is O(n $^{2}$× m) (n is the number of the objects and m the number of the attributes of an information system). This paper presents another effective second attribute algorithm for facilitating the use of the second attribute theorem, with computation on the tree expression of an information system. The time complexity of the new algorithm is linear in n. This algorithm is proved to be equivalent to the algorithm on the discernibility matrix.
Starting Page	383
Ending Page	392
Page Count	10
File Format	PDF
ISSN	10009000
Journal	Journal of Computer Science and Technology
Volume Number	21
Issue Number	3
e-ISSN	18604749
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2006-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	attribute order second attribute discernibility matrix tree expression Theory of Computation Information Systems Applications (incl.Internet) Artificial Intelligence (incl. Robotics) Computer Science Software Engineering Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computer Science Applications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A reduction algorithm meeting users’ requirements

Reduct and attribute order

Reduction algorithms based on discernibility matrix: The ordered attributes method

Investigation on AQ11, ID3 and the principle of discernibility matrix

Learning with Uncertain Kernel Matrix Set

Tree Expressions for Information Systems

Direct Model Checking Matrix Algorithm

A practical algorithm for the minimum rectilinear steiner tree

A non-collision hash trie-tree based fast IP classification algorithm

Second Attribute Algorithm Based on Tree Expression

Similar Documents

A reduction algorithm meeting users’ requirements

Reduct and attribute order

Reduction algorithms based on discernibility matrix: The ordered attributes method

Investigation on AQ11, ID3 and the principle of discernibility matrix

Learning with Uncertain Kernel Matrix Set

Tree Expressions for Information Systems

Direct Model Checking Matrix Algorithm

A practical algorithm for the minimum rectilinear steiner tree

A non-collision hash trie-tree based fast IP classification algorithm

Second Attribute Algorithm Based on Tree Expression