๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A novel clustering algorithm using hypergraph-based granular computing

โœ Scribed by Qun Liu; XiaoFeng Liao; Yu Wu

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
279 KB
Volume
25
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis

Clustering is an important technique in data mining. In this paper, we introduce a new clustering algorithm. This algorithm, based on granular computing, constructs a hypergraph (simplicial complex) by the hypergraph bisection algorithm. It will discover the similarities and associations among documents. In some experiments on Web data, the proposed algorithm is used; the results are quite satisfactory.

๐Ÿ“œ SIMILAR VOLUMES

Task Matching and Scheduling in Heteroge
Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach
โœ Lee Wang; Howard Jay Siegel; Vwani P. Roychowdhury; Anthony A. Maciejewski ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

To exploit a heterogeneous computing (HC) environment, an application task may be decomposed into subtasks that have data dependencies. Subtask matching and scheduling consists of assigning subtasks to machines, ordering subtask execution for each machine, and ordering intermachine data transfers. T