An Analysis of Some Graph Theoretical Cluster Techniques

Augustson, J. Gary; Minker, Jack

doi:10.1145/321607.321608

Cited by 187 publications

(96 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, for a proper clique construction it suffices to send neighbourhood information only 2 hops away. Similar to Xue et al [3], we use the Bierstone algorithm [26] for clique identification. The Bierstone algorithm has a complexity of O(l 2 l ), where l l is the number of links in the local analysed subgraph, which contains only nodes at most 2 hops away from the computing node.…”

Section: Mobility and Clique Constructionmentioning

confidence: 99%

A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks

Curescu

Nadjm‐Tehrani

2008

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a resourceutility function, and our algorithms aim to maximize aggregated utility. The shared channel is modeled as a bandwidth resource defined by maximal cliques of mutual interfering links.We propose a novel resource allocation algorithm that employs an auction mechanism in which flows are bidding for resources. The bids depend both on the flow's utility function and the intrinsically derived shadow prices. We then combine the admission control scheme with a utility-aware on-demand shortest path routing algorithm where shadow prices are used as a natural distance metric.As a baseline for evaluation we show that the problem can be formulated as a linear programming (LP) problem. Thus, we can compare the performance of our distributed scheme to the centralized LP solution, registering results very close to the optimum. Next we isolate the performance of price-based routing and show its advantages in hotspot scenarios, and also propose an asynchronous version that is more feasible for ad hoc environments.Further experimental evaluation compares our scheme with the state-of-the-art derived from Kelly's utility maximization framework and shows that our approach exhibits superior performance for networks with increased mobility or less frequent allocations.Index Terms-Mobile computing, pricing and resource allocation, quality of service, optimization, performance evaluation of algorithms and systems.

show abstract

Section: Mobility and Clique Constructionmentioning

confidence: 99%

A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks

Curescu

Nadjm‐Tehrani

2008

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Prior to the World Wide Web age, link structures were studied in the area of bibliometrics, which studies the citation structure of written documents [15,23]. Many works in this area were aimed at finding high-impact papers published in scientific journals [10], and at clustering related documents [1].…”

Section: Introductionmentioning

confidence: 99%

The stochastic approach for link-structure analysis (SALSA) and the TKC effect

2000

View full text Add to dashboard Cite

This article is being produced via complete electronic text/image integration, to enable full database storage. It has therefore to meet specific standards regarding structure and presentation.This proof is an automatically produced, low-resolution laser-printer output. The final product will naturally meet our high-quality standards regarding resolution and page lay-out.Please use this proof solely for checking of typesetting/editing and completeness of text and figures. Changes to the article as accepted for publication will not be considered at this stage. Elsevier Science N.L. Computer Networks 00 (2000) COMPNW2288The stochastic approach for link-structure analysis (SALSA) and the TKC effect 1 R. Lempel Ł , S. Moran Department of Computer Science, The Technion, Haifa 32000, Israel AbstractToday, when searching for information on the World Wide Web, one usually performs a query through a term-based search engine. These engines return, as the query's result, a list of Web sites whose contents match the query. For broad topic queries, such searches often result in a huge set of retrieved documents, many of which are irrelevant to the user. However, much information is contained in the link-structure of the World Wide Web. Information such as which pages are linked to others can be used to augment search algorithms. In this context, Jon Kleinberg introduced the notion of two distinct types of Web sites: hubs and authorities. Kleinberg argued that hubs and authorities exhibit a mutually reinforcing relationship: a good hub will point to many authorities, and a good authority will be pointed at by many hubs. In light of this, he devised an algorithm aimed at finding authoritative sites. We present SALSA, a new stochastic approach for link structure analysis, which examines random walks on graphs derived from the link structure. We show that both SALSA and Kleinberg's mutual reinforcement approach employ the same meta-algorithm. We then prove that SALSA is equivalent to a weighted in-degree analysis of the link-structure of World Wide Web subgraphs, making it computationally more efficient than the mutual reinforcement approach. We compare the results of applying SALSA to the results derived through Kleinberg's approach. These comparisons reveal a topological phenomenon called the TKC effect (Tightly Knit Community) which, in certain cases, prevents the mutual reinforcement approach from identifying meaningful authorities. 

show abstract

“…Complete-link clusters are maximal complete sub-graphs [27] and are related to the node colorability of graphs [28]. The maximal complete sub-graph was considered the strictest definition of a cluster in [29] and [30]. A graph-oriented approach for non-hierarchical structures and over-lapping clusters is presented in [31].…”

Section: )mentioning

confidence: 99%

State of Art of Different Clustering Approaches

Rawlani¹,

Natekar²,

Pathak³

et al. 2015

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

This Paper presents an overview of the clustering and its methods used in Data Mining. Firstly, different measures that are used for determining whether two clusters are similar or dissimilar are defined. Then different methods of clustering are presented and are divided into: hierarchical, partitional and evolutionary algorithms. Finally clustering is performed in large data sets and subsequently their challenges are discussed.

show abstract

An Analysis of Some Graph Theoretical Cluster Techniques

Cited by 187 publications

References 12 publications

A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks

A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks

The stochastic approach for link-structure analysis (SALSA) and the TKC effect

State of Art of Different Clustering Approaches

Contact Info

Product

Resources

About