Meth Hunter: an Extension of Automated Intelligence Systems via Graph Database
نویسندگان
چکیده
Automated intelligence analysis was born into a skeptical community dealing with high stakes dilemmas, where often outcomes are measured in loss of human life. The massive amount of data require analysts to be masters of identifying “indicators” intuitively foreshadowing intelligence targets and masters of modeling the indicators in analysis systems. The paper explores the application of graph theory through graph databases to determine how the index-free adjacency of graph databases can be exploited to improve processing time. The study utilized the Meth Hunter, an analytic machine designed to identify methamphetamine conspirators by analyzing pseudoephedrine purchase records as a case study. The graph database (Neo4j) was compared to a SQL relational database (WAMP). Neo4j demonstrated superior performance in identifying and retrieving relationships between data points. Neo4j successfully demonstrated the ability to implement such a strategy and extend the horizons of traditional data mining systems. Keyword—Automated intelligence; big data; graph database;
منابع مشابه
An Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملAn algebra of database preferences
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a query means to select the maximal elements from the respective database w.r.t. to the preference, which is a partial strict-order. We present a point-free calculus of such preferences and exemplify its use in proving algebraic laws about preferences that can be used in query optimisation. We show ...
متن کاملOn Automated Design of Mechatronic Systems through Bond - Graphs and Genetic Programming
Bond-Graphs based representation and genetic programming based search and synthesis can be combined for automated design of mechatronic or multi domain dynamic systems. This design scheme can be turned into an intelligent automated design system by introducing a dynamic database or knowledge library of relevant information (gathered through design experience) which tends to help the designer in...
متن کاملRetrieval–travel-time model for free-fall-flow-rack automated storage and retrieval system
Automated storage and retrieval systems (AS/RSs) are material handling systems that are frequently used in manufacturing and distribution centers. The modelling of the retrieval–travel time of an AS/RS (expected product delivery time) is practically important, because it allows us to evaluate and improve the system throughput. The free-fall-flow-rack AS/RS has emerged as a new technology for dr...
متن کاملEncoding the dynamics of deterministic systems
We present a model for the dynamics of discrete deterministic systems, based on an extension of the Petri nets framework. Our model relies on the definition of a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. We provide a characterization in terms of a local consistency condition of those deterministic systems whose dyn...
متن کامل