The week's pick
Random Articles
Reseach Article
Inconsistency Extraction using Advanced FP-Growth Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 105 - Number 5 |
| Year of Publication: 2014 |
| Authors: Pravin Gaikwad, Jyoti Kulkarni |
10.5120/18371-9527
|
Pravin Gaikwad, Jyoti Kulkarni . Inconsistency Extraction using Advanced FP-Growth Algorithm. International Journal of Computer Applications. 105, 5 ( November 2014), 6-10. DOI=10.5120/18371-9527
Abstract
Inconsistency or Anomaly extraction refers to the automatically finding a large set of flows observed during an anomalous time interval, the flows associated with anomalous events. It is valuable for root causes analysis, network forensics, anomaly modeling, and attack mitigation. In this paper, histogram based detectors are used which provide a meta-data which is useful for identifying suspicious flows and then apply association algorithm like Advanced FP-Growth Algorithm to summarize and find anomalous flows. Using rich traffic data from a network, Paper show that a technique efficiently finds the flows associated with anomalous events. In addition, an algorithm reduces the both in runtime and the main memory consumption. The inconsistency extraction method significantly reduces the working hours needed for anomaly detection system more practical.
References
- D. Baruckhoff, X. Dimitropoulos, A. Wagner, and K. Salamatian, " Anomaly Extraction In Backbone Networks Using Association Rules" , in proc. IEEE ACM TRANSACTION ON NETWORKING, VOL 20. NO 6, DECEMBER 2012.
- P. Barford, J. Kline, D. Plonka, and A. Ron, "A signal analysis of network traffic anomalies," in Proc. ACM SIGCOMM Internet Measurement Workshop, Nov. 2002, pp. 71-82.
- Y. Zhang, Z. Ge, A. Greenberg, and M. Roughan, "Network anomography," in Proc. ACM SIGCOMM Internet Measurement Conf. , Oct. 2005.
- A. Lakhina, M. Crovella, and C. Diot, "Mining anomalies using traffic feature distributions," in ACM SIGCOMM '05, 2005, pp. 217-228.
- Y. Gu, A. McCallum, and D. Towsley, "Detecting anomalies in network traffic using maximum entropy estimation," in IMC'05: Proc. Internet Measurement Conf. 2005 Internet Measurement Conf. . Berkeley, CA, USA: USENIX Association, 2005, pp. 32-32.
- A. Kind, M. P. Stoecklin, and X. Dimitropoulos, "Histogram-basedtraffic anomaly detection," IEEE Trans. Netw. Service Manage. , vol. 6, no. 2, pp. 110–121, Jun. 2009.
- F. Silveira and C. Diot, "URCA: Pulling out anomalies by their root causes," in Proc. IEEE INFOCOM, Mar. 2010, pp. 1–9.
- S. Ranjan, S. Shah, A. Nucci, M. M. Munaf`o, R. L. Cruz, and S. M. Muthukrishnan, "Dowitcher: Effective worm detection and containment in the Internet core," in Proc. IEEE INFOCOM, 2007, pp. 2541–2545.
- G. Cormode and S. Muthukrishnan, "What?s new: Finding significant differences in network data streams," IEEE/ACM Trans. Netw. , vol. 13, no. 6, pp. 1219–1232, Dec. 2005.
- Ding Zhenguo, Wei Qinqin, Ding Xianhua "An Improved FP-growth Algorithm Based on Compound Single Linked List". In Proc. IEEE 2009.
- R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in Proc. 20th VLDB, Santiago de Chile, Chile, Sep. 12–15, 1994, pp. 487–499.
- Han,J. ,Pei J. ,Yin,Y (1999). Mining Frequent Paterns Without Candidate Generation. Technical Report CMPT99-12, Schoolo f Computing Science, Simon Fraser University.
- B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, "Sketch-based change detection: Methods, evaluation, and applications," in Proc. 3rd ACMSIGCOMM IMC, 2003, pp. 234–247.
- X. Li, F. Bian, M. Crovella, C. Diot, R. Govindan, G. Iannaccone, and A. Lakhina, "Detection and identification of network anomalies using sketch subspaces," in Proc. 6th ACM SIGCOMM IMC, 2006, pp. 147–152 .
Index Terms
Keywords