A. Overview A hierarchy is simply viewed as a family of stratified levels, without further constraints. A hierarchy represents different levels of granularity in granular computing. There are two important issues of the simple definition. The basic ingredients of a hierarchy are levels, and furthermore the levels are linked together by a partial order. A level is populated by, or consists of, granules (or entities) whose properties characterize the level. Levels may be considered as parts, and the partial order describes the relations between, or dependency of, parts. Under the partial order, parts are arranged inside a whole described by a hierarchy. A level itself can be a hierarchy, which in turn consists of many levels. Conversely, one may combine levels into a hierarchy as one level in the original hierarchy. The combination and decomposition processes add more expressive power of the notion of hierarchy. The general principles of hierarchical analysis and granular computing, understanding of the whole in terms of its parts and understanding of the system based on its inherent internal structures, are almost universally applicable. In practice, one also needs to consider the particular features of a system or project. When describing a specific system, one may impose on additional system dependent constraints and interpretations.
"synopsis" may belong to another edition of this title.
Book Description Allyn & Bacon, 1980. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0205068588