Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Neighborhood systems and relational databases
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Data mining, rough sets and granular computing
A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering
International Journal of Approximate Reasoning
Granular computing: structures, representations, and applications
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Hi-index | 0.00 |
In this chapter, granular computing is used to process the Web information. The main result is that the human thinking inside a document set can be represented by a polyhedron; more general cases are discussed. A polyhedron is a subset of Euclidean space that supports a combinatorial structure, called simplicial complex. From the granular computing point of view, a simplicial complex is a special form of the granular model, in which the granular structure satisfies the closed condition (geometric concept). It is important to note that it is equivalent to the Apriori principle (data mining concept). A point in such a polyhedron represents a human thought. Each simplex represents a concept. A maximal simplex is a primitive concept. A connected component represents a complete concept. The totality of these concepts is called the basic knowledge.