Graph connectivity in electrical studies
Graph connectivity in electrical studies
- Author(s): F.L. Gaol and B. Widjaja
- DOI: 10.1049/ic:20070764
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): F.L. Gaol and B. Widjaja Source: IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007), 2007 p. 1047 – 1052
- Conference: IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007)
- DOI: 10.1049/ic:20070764
- ISBN: 978 0 86341 937 9
- Location: Tamil Nadu, India
- Conference date: 20-22 Dec. 2007
- Format: PDF
Graph connectivity become central theme in electrical studies. We proposed a novel algorithm for cluster analysis that is based on graph theoretic techniques. A similarity graph is defined and clusters in that graph correspond to highly connected subgraphs. A polynomial algorithm to compute them efficiently is presented. Our algorithm produces a solution with some provably good properties and performs well on synthetic data.
Inspec keywords: pattern clustering; graph theory; statistical analysis
Subjects: Combinatorial mathematics; Pattern recognition; Other topics in statistics; Combinatorial mathematics; Other topics in statistics
Related content
content/conferences/10.1049/ic_20070764
pub_keyword,iet_inspecKeyword,pub_concept
6
6