121 resultados para Multilevel Graph Partitioning
Resumo:
This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.
Resumo:
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique uses a graph-based approach to model the communication structure observed in real-world traces and to extract traffic templates. By combining extracted and user-defined traffic templates, realistic network flow traces that comprise normal traffic and customized conditions are generated in a scalable manner. A proof-of-concept implementation demonstrates the utility and simplicity of our method to produce a variety of evaluation scenarios. We show that the extraction of templates from real-world traffic leads to a manageable number of templates that still enable accurate re-creation of the original communication properties on the network flow level.
Resumo:
Objectives To compare different ways of measuring partner notification (PN) outcomes with published audit standards, examine variability between clinics and examine factors contributing to variation in PN outcomes in genitourinary medicine (GUM) clinics in the UK. Methods Reanalysis of the 2007 BASHH national chlamydia audit. The primary outcome was the number of partners per index case tested for chlamydia, as verified by a healthcare worker or, if missing, reported by the patient. Control charts were used to examine variation between clinics considering missing values as zero or excluding missing values. Hierarchical logistic regression was used to investigate factors contributing to variation in outcomes. Results Data from 4616 individuals in 169 genitourinary medicine clinics were analysed. There was no information about the primary outcome in 41% of records. The mean number of partners tested for chlamydia ranged from 0 to 1.5 per index case per clinic. The median across all clinics was 0.47 when missing values were assumed to be zero and 0.92 per index case when missing values were excluded. Men who have sex with men were less likely than heterosexual men and patients with symptoms (4-week look-back period) were less likely than asymptomatic patients (6-month look-back) to report having one or more partners tested for chlamydia. There was no association between the primary outcome and the type of the health professional giving the PN advice. Conclusions The completeness of PN outcomes recorded in clinical notes needs to improve. Further research is needed to identify auditable measures that are associated with successful PN that prevents repeated chlamydia in index cases.