Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Average user lifetime (1)
- Classification (1)
- Clustering (1)
- Computer science (1)
- Delay (1)
-
- Deterministic graph (1)
- Dynamic partitioning behavior (1)
- Explosions (1)
- Failure analysis (1)
- Graph theory (1)
- Information Retrieval (1)
- Knowledge Discovery (1)
- Large-scale network (1)
- Large-scale systems (1)
- P2P network (1)
- Pattern analysis (1)
- Peer-to-peer computing (1)
- Performance analysis (1)
- Power system modeling (1)
- Probability (1)
- Random graph theory (1)
- Random processes (1)
- Resilience (1)
- Static partitioning behavior (1)
- Web Mining (1)
Articles 1 - 2 of 2
Full-Text Articles in Other Computer Sciences
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Computer Science Faculty Publications
Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …