Tsau Young Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tsau Young Lin has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Churn-Jung Liau
Academia Sinica
1 shared publication - Gang Xie
Taiyuan University of Science and Technology
1 shared publication - Jianchao Han
California State University Domínguez Hills
1 shared publication Joseph Tremba
Department of Mathematics and Computer Science, San Jose State University, San Jose, CA 95192
1 shared publicationLotfi A. Zadeh
Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720-1776
1 shared publication- Wen-Liang Huang
China United Network Communication Corporation, 100032 Beijing, China
1 shared publication
Latest Publications
- 17 June 2013
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 28 (9) , 843-864
Knowledge Approximations in Binary Relation: Granular Computing Approach
- 17 June 2013
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 28 (9) , 843-864
Knowledge Approximations in Binary Relation: Granular Computing Approach
- 1 January 2013
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 127 (1-4) , 413-428
Unifying Rough Set Theories via Large Scaled Granular Computing
This paper explains the mathematics of large scaled granular computing (GrC), augmented with a new Knowledge theory, by unifying rough set theories (RS) into one single concept, namely, neighborhood systems (NS). NS was first introduced in 1989 by T. Y. Lin to capture the concepts of “near” (topology) and “conflict” (security). Since 1996 when the term Granular Computing (GrC) was coined by T. Y. Lin to label Zadeh's vision, NS has been pushed into the “heart” of GrC. In 2011, LNS, the largest NS, was axiomatized; it implied that this set of axioms defines a new mathematics that realizes Zadeh's vision. The main messages are: this new mathematics is powerful and practical.
- 1 January 2013
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 127 (1-4) , 413-428
Unifying Rough Set Theories via Large Scaled Granular Computing
This paper explains the mathematics of large scaled granular computing (GrC), augmented with a new Knowledge theory, by unifying rough set theories (RS) into one single concept, namely, neighborhood systems (NS). NS was first introduced in 1989 by T. Y. Lin to capture the concepts of “near” (topology) and “conflict” (security). Since 1996 when the term Granular Computing (GrC) was coined by T. Y. Lin to label Zadeh's vision, NS has been pushed into the “heart” of GrC. In 2011, LNS, the largest NS, was axiomatized; it implied that this set of axioms defines a new mathematics that realizes Zadeh's vision. The main messages are: this new mathematics is powerful and practical.
- 10 December 2009
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 25 (2) , 111-117
Granular computing: Models and applications
- 10 December 2009
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 25 (2) , 111-117
Granular computing: Models and applications
- 1 January 2009
- Published by Springer Nature
- p. 445-468
Granular Computing and Rough Sets - An Incremental Development
- 1 January 2009
- Published by Springer Nature
- p. 445-468
Granular Computing and Rough Sets - An Incremental Development
- 31 July 2005
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 40 (1-2) , 1-2
Introduction to special issues on data mining and granular computing
- 31 July 2005
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 40 (1-2) , 1-2
Introduction to special issues on data mining and granular computing
- 26 May 2004
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 19 (7) , 565-566
Special issue on granular computing and data mining
- 26 May 2004
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 19 (7) , 565-566
Special issue on granular computing and data mining
- 29 January 2002
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 17 (2) , 223-233
Attribute transformations for data mining II: Applications to economic and stock market data
- 29 January 2002
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 17 (2) , 223-233
Attribute transformations for data mining II: Applications to economic and stock market data
- 29 January 2002
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 17 (2) , 213-222
Attribute transformations for data mining I: Theoretical explorations
Attribute (feature) transformations on databases are examined from a data mining prospect. Theoretical examples from classical mathematics are used to illustrate the effects of the transformations: (1) Certain examples show that attribute transformations are the only means to bring out the patterns to visible states. (2) There are no apparent hints from the raw data as to what transformations could be employed; domain experts need to be in the loop of data mining. (3) All transformations can be expressed, or more precisely approximated, by polynomials. Such expressions provide some means for a brute force search (one degree at a time) of the transformations. A reasonable success in a linear case (degree one) is reported in Ref. 2. © 2002 John Wiley & Sons, Inc.
- 29 January 2002
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 17 (2) , 213-222
Attribute transformations for data mining I: Theoretical explorations
Attribute (feature) transformations on databases are examined from a data mining prospect. Theoretical examples from classical mathematics are used to illustrate the effects of the transformations: (1) Certain examples show that attribute transformations are the only means to bring out the patterns to visible states. (2) There are no apparent hints from the raw data as to what transformations could be employed; domain experts need to be in the loop of data mining. (3) All transformations can be expressed, or more precisely approximated, by polynomials. Such expressions provide some means for a brute force search (one degree at a time) of the transformations. A reasonable success in a linear case (degree one) is reported in Ref. 2. © 2002 John Wiley & Sons, Inc.
- 1 January 2001
- Published by Springer Nature
- p. 125-142
Granulation and Nearest Neighborhoods: Rough Set Approach
- 1 January 2001
- Published by Springer Nature
- p. 125-142
Granulation and Nearest Neighborhoods: Rough Set Approach