DEFECT: discover and eradicate fool around node in emergency network using combinatorial techniques
- 31 October 2020
- journal article
- research article
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (5) , 5995-6006
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A distributed frequent itemset mining algorithm using Spark for Big Data analyticsCluster Computing, 2015
- Efficient Algorithms for Mining Top-K High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering, 2015
- Share-Frequent Sensor Patterns Mining from Wireless Sensor Network DataIEEE Transactions on Parallel and Distributed Systems, 2014
- New Techniques for Mining Frequent Patterns in Unordered TreesIEEE Transactions on Cybernetics, 2014
- Fast mining frequent itemsets using NodesetsExpert Systems with Applications, 2014
- Mining frequent patterns from dynamic data streams with data load managementJournal of Systems and Software, 2012
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$IEEE Transactions on Information Theory, 2011
- Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approachExpert Systems with Applications, 2009
- An efficient and flexible algorithm for online mining of large itemsetsInformation Processing Letters, 2004
- Approximate Inclusion-ExclusionCombinatorica, 1990