Brahms Ques Ankesh

Question is for the Presentation: Brahms_Medha_Presentation_0918
Question is asked by: Ankesh Khandelwal
The Question is: * @Pg 7-"executing a bi-directional breadth-first search (bi-BFS) utilizing a trie representation of the search structures in order to find semantic associations... I couldn't understand the search structure outlined here
@Pg 10- Memory usage for data-sets of sizes 14, 255, 14, 556 are 20, 270, 10, 501 MBs respectively. In 2 cases there have been significant %age drop in storage sizes and in other 2 there have been increase in storage sizes. How can this be explained? (number of resources vs. number of triples for each of them?)
Casual Question- The motivation is drawn from examples in Anti-money Laundering, Threat Assessment and Risk Assessment. However, the system has been tested only for Insider Threat Project, whose expected data set size is small. Aren't above data sets too huge, to keep memory based associations feasible?

Question asked	* @Pg 7-"executing a bi-directional breadt … * @Pg 7-"executing a bi-directional breadth-first search (bi-BFS) utilizing a trie representation of the search structures in order to find semantic associations... I couldn't understand the search structure outlined here @Pg 10- Memory usage for data-sets of sizes 14, 255, 14, 556 are 20, 270, 10, 501 MBs respectively. In 2 cases there have been significant %age drop in storage sizes and in other 2 there have been increase in storage sizes. How can this be explained? (number of resources vs. number of triples for each of them?) Casual Question- The motivation is drawn from examples in Anti-money Laundering, Threat Assessment and Risk Assessment. However, the system has been tested only for Insider Threat Project, whose expected data set size is small. Aren't above data sets too huge, to keep memory based associations feasible? o keep memory based associations feasible?
Question asked by	Ankesh Khandelwal +
Question for the Presentation	Brahms Medha Presentation 0918 +