1 COMBINATION OF ROUGH AND FUZZY SETS BASED ON α-LEVEL SETS (2009)
A fuzzy set can be represented by a family of crisp sets using its α-level sets, whereas a rough set can be represented by three crisp sets. Based on such representations, this paper examines some...
Y.(2004) A three-layered conceptual framework of data mining (2008)
Summary. The study of the foundations of data mining may be viewed as a scientific inquiry into the nature of data mining and the scope of data mining methods. There is not enough attention paid to...
Ning Zhong, Jiming Liu, Y. Y. Yao, Setsuo Ohsuga
The 21st century is the age of Intemet and World Wide Web. The Web revolutionizes the way we gather, process, and use information. At the same time, it also redefines the meanings and processes of...
Vector-based information (2008)
This paper analyzes the properties, structures
1 On Unifying Formal Concept Analysis and Rough Set Analysis (2008)
Formal concept analysis (FCA) and rough set analysis (RSA) are two complementary approaches for analyzing data [1,13,27,34]. Many proposals have been made to compare and combine the two theories, and...
A General Definition of an Attribute Reduct (2008)
Abstract. A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an...
Web Intelligence (WI): research challenges and trends in the new information age (2008)
Y. Y. Yao, Ning Zhong, Jiming Liu, Setsuo Ohsuga
Abstract. This paper is about a new research field called Web Intelligence (WI for short). We try to explain the needs for coining the term as a sub-discipline of computer science for systematic...
Web-based Support Systems for Sustainable Communities (2008)
W. N. Liu, J. T. Yao, L. Fan, Y. Y. Yao, X. D. Yang
This paper studies Web-based support systems for sustainable communities. A sustainable community is a community that respects the needs of both nature and future generations. A sustainable community...
In this paper, we argue that granular computing may have many potential applications in knowledge discovery and data mining. Three related basic operations of granular computing are examined:...
LI-Engine: A New Sequential Control Model for Prolog (2007)
Exploitation of architectural support for Prolog-like languages takes one of two main paths: compiler-based or interpreter-based. The former scheme enforces the transformation from a logic program to...
In this paper, we argue that granular computing may have many potential applications in knowledge discovery and data mining. Three related basic operations of granular computing are examined:...
Mining Ordering Rules Using Rough Set Theory (2007)
Abstract: Many real world problems deal with ordering of objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter....
Abstract. In this paper, we apply possibilistic reasoning to information retrieval for documents endowed with similarity relations. On the one hand, it is used together with Boolean models for...
A Generalized Decision Logic Language (2007)
For Granular Computing, Y. Y. Yao, Churn-jung Liau
A generalized decision logic language DGL is proposed for granular computing (GrC) in the Tarski's style through the notions of a model and satisfiability. The model is an information table...
A Partition Model of Granular Computing (2004)
There are two objectives of this chapter. One objective is to examine the basic principles and issues of granular computing. We focus on the tasks of granulation and computing with granules. From...
Level Construction of Decision Trees (2004)
A partition-based framework is presented for a formal study of consistent classification problems. An information table is used as knowledge representation. Solutions to, and solution space of,...
Web-based support systems (2003)
Web-based support systems (WSS) concern multidisciplinary investigations which combine computer technologies and domain specific studies. Domain specific studies focus on the investigation of...
On generalizing rough set theory (2003)
Abstract. This paper summarizes various formulations of the standard rough set theory. It demonstrates how those formulations can be adopted to develop different generalized rough set theories. The...
Probabilistic approaches to rough sets (2003)
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a...
Mining high order decision rules (2003)
Abstract. We introduce the notion of high order decision rules. While a standard decision rule expresses connections between attribute values of the same object, a high order decision rule expresses...
Information granulation and approximation in a decision-theoretical model of rough sets (2003)
Summary. Granulation of the universe and approximation of concepts in the granulated universe are two related fundamental issues in the theory of rough sets. Many proposals dealing with the two...
Abstract. A database may be considered as a statistical population, and an attribute as a statistical variable taking values from its domain. One can carry out statistical and information-theoretic...
Information granulation for Web based information retrieval support systems (2003)
In this paper, we discuss the potential applications of data mining techniques for the design of Web based information retrieval support systems (IRSS). In particular, we apply clustering methods for...
Web-based Information Retrieval Support Systems: (2003)
Building Research Tools, J. T. Yao, Y. Y. Yao
The concept of Web-based Information Retrieval Support Systems (WIRSS) is introduced. The needs for WIRSS are shown by a detailed case study of existing research article indexing and citation...
Explanation oriented association mining using rough set theory (2003)
Y. Y. Yao, Y. Zhao, R. B. Maguire
Abstract. This paper presents a new philosophical view and methodology for data mining. A framework of explanation oriented data mining is proposed and studied with respect to association mining. The...
Mining high order decision rules (2003)
Abstract. We introduce the notion of high order decision rules. While a standard decision rule expresses connections between attribute values of the same object, a high order decision rule expresses...
CUPTRSS: A Web-based Research Support System (2003)
Hong Tang Yu, Yu Wu, J. T. Yao, Gouyin Wang, Y. Y. Yao
Research Support Systems (RSS) provide research organizations and scientists with information and facility for improving their research capacity, quality and productivity. Application of Web...
Y. Y. Yao, Y. Zhao, R. B. Maguire
Abstract. We propose a new framework of explanation-oriented data mining by adding an explanation construction and evaluation phase to the data mining process. While traditional approaches...
On generalizing rough set theory (2003)
Abstract. This paper summarizes various formulations of the standard rough set theory. It demonstrates how those formulations can be adopted to develop different generalized rough set theories. The...
Probabilistic approaches to rough sets (2003)
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a...
A step towards the foundations of data mining (2003)
This paper addresses some fundamental issues related to the foundations of data mining. It is argued that there is an urgent need for formal and mathematical modeling of data mining. A formal...
The concept of Web-based Information Retrieval Support Systems (WIRSS) is introduced. The needs for WIRSS are shown by a detailed case study of existing research article indexing and citation...
A generalized decision logic language for granular computing (2002)
Abstract- A generalized decision logic language GDL is proposed for granular computing (GrC) in the Tarski’s style through the notions of a model and satisfiability. The model is an information...
Induction of classification rules by granular computing (2002)
Abstract. A granular computing model is used for learning classification rules by considering the two basic issues: concept formation and concept relationships identification. A classification rule...
A granular computing approach to machine learning (2002)
The key to granular computing is to make use of granules in problem solving. Classification is one of the well studied problems in machine learning and data mining as it involves of discovery...
Granular computing as a basis for consistent classification problems (2002)
Within a granular computing model of data mining, we reformulate the consistent classification problems. The granulation structures are partitions of a universe. A solution to a consistent...
Information retrieval support systems (2002)
Abstract- Information retrieval support systems (IRSS) are designed with the objective to provide the necessary utilities, tools, and languages that support a user to perform various tasks in finding...
A generalized decision logic language for granular computing (2002)
Abstract- A generalized decision logic language GDL is proposed for granular computing (GrC) in the Tarski's style through the notions of a model and satisfiability. The model is an information...
Induction of classification rules by granular computing (2002)
Abstract. A granular computing model is used for learning classification rules by considering the two basic issues: concept formation and concept relationships identification. A classification rule...
On Modal Decision Logics (2002)
Tuan-fang Fan, Churn-jung Liau, Y. Y. Yao
Some modal decision logic languages are proposed for knowledge representation in data mining through the notions of models and satisability. The models are collections of data tables consisting of a...
Granular Computing Using Information Tables (2002)
Abstract. A simple and more concrete granular computing model may be developed using the notion of information tables. In this framework, each object in a finite nonempty universe is described by a...
On modal decision logics (2002)
Tuan-fang Fan, Churn-jung Liau, Y. Y. Yao
Some modal decision logic languages are proposed for knowledge representation in data mining through the notions of models and satisfiability. The models are collections of data tables consisting of...
On Modeling data mining with granular computing (2001)
The main objective of this paper is to advocate for formal and mathematical modeling of data mining, which unfortunately has not received much attention. A framework is proposed for rule mining based...
Data analysis and mining in ordered information tables (2001)
Ying Sai, Y. Y. Yao, Ning Zhong
Many real world problems deal with ordering objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. For modeling...
Data analysis and mining in ordered information tables (2001)
Many real world problems deal with ordering objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. For modeling...
Information tables with neighborhood semantics, Data Mining and Knowledge Discovery: Theory (2000)
Information tables provide a convenient and useful tool for representing a set of objects using a group of attributes. This notion is enriched by introducing neighborhood systems on attribute values....
Granular computing: basic issues and possible solutions (2000)
Abstract: Granular computing (GrC) may be regarded as a label of theories, methodologies, techniques, and tools that make use of granules, i.e., groups, classes, or clusters of a universe, in the...
Granular computing: basic issues and possible solutions (2000)
Abstract: Granular computing (GrC) may be regarded as a label of theories, methodologies, techniques, and tools that make use of granules, i.e., groups, classes, or clusters of a universe, in the...
Information tables with neighborhood semantics, Data Mining and Knowledge Discovery: Theory (2000)
Information tables provide a convenient and useful tool for representing a set of objects using a group of attributes. This notion is enriched by introducing neighborhood systems on attribute values....
An analysis of quantitative measures associated with rules (1999)
Abstract. In this paper, we analyze quantitative measures associated with if-then type rules. Basic quantities are identified and many existing measures are examined using the basic quantities. The...
On data and probabilistic dependencies (1999)
Data dependencies have been extensively studied in relational databases as they play a key role in the normalization process. On the other hand, probabilistic reasoning systems would not be practical...
An analysis of quantitative measures associated with rules (1999)
Abstract. In this paper, we analyze quantitative measures associated with if-then type rules. Basic quantities are identified and many existing measures are examined using the basic quantities. The...
Granular computing using neighborhood systems, in (1999)
A set-theoretic framework is proposed for granular computing. Each element of a universe is associated with a nonempty family of neighborhoods. A neighborhood of an element consists of those elements...
Stratified rough sets and granular computing (1999)
This paper examines granulation structures for stratified rough set approximations. With respect to different level of granulations, various approximations are obtained. Two special types of...
sets, neighborhood systems, and granular computing (1999)
Granulation of a universe involves grouping of similar elements into granules. With granulated views, we deal with approximations of concepts, represented by subsets of the universe, in terms of...
On information-theoretic measures of attribute importance (1999)
Abstract. An attribute is deemed important in data mining if it partitions the database such that previously unknown regularities are observable. Many information-theoretic measures have been applied...
On information-theoretic measures of attribute importance (1999)
Abstract. An attribute is deemed important in data mining if it partitions the database such that previously unknown regularities are observable. Many information-theoretic measures have been applied...
A generalized decision logic in interval-set-valued information tables (1999)
Abstract. A generalized decision logic in interval-set-valued information tables is introduced, which is an extension of decision logic studied by Pawlak. Each object in an interval-set-valued...
Interpretations of belief functions in the theory of rough sets (1998)
This paper reviews and examines interpretations of belief functions in the theory of rough sets with finite universe. The concept of standard rough set algebras is generalized in two directions. One...
On generalizing Pawlak approximation operators (1998)
Abstract. This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and posets. The...
A comparative study of fuzzy sets and rough sets (1998)
This paper reviews and compares theories of fuzzy sets and rough sets. Two approaches for the formulation of fuzzy sets are reviewed, one is based on many-valued logic and the other is based on modal...
Constructive and algebraic methods of the theory of rough sets (1998)
This paper reviews and compares constructive and algebraic approaches in the study of rough sets. In the constructive approach, one starts from a binary relation and defines a pair of lower and upper...
A Review of Rough Set Models (1997)
Since introduction of the theory of rough set in early eighties, considerable work has been done on the development and application of this new theory. The paper provides a review of the Pawlak rough...
Two views of the theory of rough sets in finite universes (1996)
This paper presents and compares two views of the theory of rough sets. The operator-oriented view interprets rough set theory as an extension of set theory with two additional unary operators. Under...
Two Views of the Theory of Rough Sets in Finite Universes (1996)
This paper presents and compares two views of the theory of rough sets. The operator-oriented view interprets rough set theory as an extension of set theory with two additional unary operators. Under...
A comparison of two interval-valued probabilistic reasoning methods (1995)
Abstract Two complementary interval-valued probabilistic reasoning approaches, the incidence calculus proposed by Bundy and the cautious probabilistic reasoning method suggested by Quinlan, are...
On modeling uncertainty with interval structures (1995)
In this paper, we introduce the notion of interval structures in an attempt to establish a unified framework for representing uncertain information. Two views are suggested for the interpretation of...
A Comparison of Two Interval-valued Probabilistic Reasoning Methods (1994)
Two complementary interval-valued probabilistic reasoning approaches, the incidence calculus proposed by Bundy and the cautious probabilistic reasoning method suggested by Quinlan, are analyzed and...
Interval-set algebra for qualitative knowledge representation (1993)
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a counterpart of the...
A decision theoretic framework for approximating concepts (1992)
This paper explores the implications of approximating a concept based on the Bayesian decision procedure, which provides a plausible unification of the fuzzy set and rough set approaches for...
A decision theoretic framework for approximating concepts (1992)
This paper explores the implications of approximating a concept based on the Bayesian decision procedure, which provides a plausible unification of the fuzzy set and rough set approaches for...
Propagation of preference relations in qualitative inference networks (1991)
Preference relations can provide a more realistic model of random phenomena than quantitative probability or belief functions. In order to use preference relations for reasoning under uncertainty, it...
Information Retrieval Based on Axiomatic Decision Theory (1989)
Wong, S. K. M., Bollmann, P., Yao, Y. Y.
The main objective of this paper is to establish a coherent framework for information retrieval based on the axiomatic decision theory. In information retrieval one has to deal with two difficult...
Experiments with Generalized Binary Probabilistic Independence Model (1989)
This paper reports experiments with the generalized binary probabilistic independence model in which more complete statistical information is used. Two basic sets of experiments, referred to as...
A Note on Inverse Document Frequency Weighting Scheme (1989)
Based on the Shannon information theory, a measure for term value is introduced. This study is an attempt to provide a theoretical justification for the inverse document frequency (IDF) weighting...
Formalization and Evaluation of Linear Relevance Feedback (1989)
Wong, S. K. M., Yao, Y. Y., Salton, Gerard, Buckley, Chris
This study outlines an adaptive method which constructs improved query vectors based on the user preference judgments on sample document pairs. In particular, the user states that some documents are...
Information Retrieval Based on Axiomatic Decision Theory (1989)
Wong, S. K. M., Bollmann, P., Yao, Y. Y.
The main objective of this paper is to establish a coherent framework for information retrieval based on the axiomatic decision theory. In information retrieval one has to deal with two difficult...
Experiments with Generalized Binary Probabilistic Independence Model (1989)
This paper reports experiments with the generalized binary probabilistic independence model in which more complete statistical information is used. Two basic sets of experiments, referred to as...
A Note on Inverse Document Frequency Weighting Scheme (1989)
Based on the Shannon information theory, a measure for term value is introduced. This study is an attempt to provide a theoretical justification for the inverse document frequency (IDF) weighting...
Formalization and Evaluation of Linear Relevance Feedback (1989)
Wong, S. K. M., Yao, Y. Y., Salton, Gerard, Buckley, Chris
This study outlines an adaptive method which constructs improved query vectors based on the user preference judgments on sample document pairs. In particular, the user states that some documents are...
Linear structure in information retrieval (1988)
Based on the concept of user preference, we investigate the linear structure in information retrieval. We also discuss a practical procedure to determine the linear decision function and present an...
Appendix contains numerous pamphlets.
Generalization of Rough Sets using Modal Logics
The theory of rough sets is an extension of set theory with two additional unary set-theoretic operators defined based on a binary relation on the universe. These two operators are related to the...