NDLI: Ranking Metric Anomaly in Invariant Networks

Please wait, while we are loading the content...

Ranking Metric Anomaly in Invariant Networks

Content Provider	ACM Digital Library
Author	Ding, Min Ge, Yong Jiang, Guofei Xiong, Hui
Copyright Year	2014
Abstract	The management of large-scale distributed information systems relies on the effective use and modeling of monitoring data collected at various points in the distributed information systems. A traditional approach to model monitoring data is to discover invariant relationships among the monitoring data. Indeed, we can discover all invariant relationships among all pairs of monitoring data and generate invariant networks, where a node is a monitoring data source (metric) and a link indicates an invariant relationship between two monitoring data. Such an invariant network representation can help system experts to localize and diagnose the system faults by examining those broken invariant relationships and their related metrics, since system faults usually propagate among the monitoring data and eventually lead to some broken invariant relationships. However, at one time, there are usually a lot of broken links (invariant relationships) within an invariant network. Without proper guidance, it is difficult for system experts to manually inspect this large number of broken links. To this end, in this article, we propose the problem of ranking metrics according to the anomaly levels for a given invariant network, while this is a nontrivial task due to the uncertainties and the complex nature of invariant networks. Specifically, we propose two types of algorithms for ranking metric anomaly by link analysis in invariant networks. Along this line, we first define two measurements to quantify the anomaly level of each metric, and introduce the $m\textit{R}ank$ algorithm. Also, we provide a weighted score mechanism and develop the $g\textit{R}ank$ algorithm, which involves an iterative process to obtain a score to measure the anomaly levels. In addition, some extended algorithms based on $m\textit{R}ank$ and $g\textit{R}ank$ algorithms are developed by taking into account the probability of being broken as well as noisy links. Finally, we validate all the proposed algorithms on a large number of real-world and synthetic data sets to illustrate the effectiveness and efficiency of different algorithms.
Starting Page	1
Ending Page	30
Page Count	30
File Format	PDF
ISSN	15564681
e-ISSN	1556472X
DOI	10.1145/2601436
Volume Number	8
Issue Number	2
Journal	ACM Transactions on Knowledge Discovery from Data (TKDD)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Metric anomaly ranking Invariant networks Link analysis
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Ranking metric anomaly in invariant networks.

Link analysis ranking: algorithms, theory, and experiments

A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts

Ordinal Distance Metric Learning for Image Ranking

Ranking the importance of alerts for problem determination in large computer systems

Link prediction in social networks: the state-of-the-art

Link sign prediction and ranking in signed directed social networks

Link analysis for Web spam detection

An online blog reading system by topic clustering and personalized ranking

Ranking Metric Anomaly in Invariant Networks

Similar Documents

Ranking metric anomaly in invariant networks.

Link analysis ranking: algorithms, theory, and experiments

A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts

Ordinal Distance Metric Learning for Image Ranking

Ranking the importance of alerts for problem determination in large computer systems

Link prediction in social networks: the state-of-the-art

Link sign prediction and ranking in signed directed social networks

Link analysis for Web spam detection

An online blog reading system by topic clustering and personalized ranking

Ranking Metric Anomaly in Invariant Networks