Optimization of Target Oriented Network Intelligence Collection for the Social Web by Using k-Beam Search

  • Aditya Shaha
  • B. K. TripathyEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1048)


Target Oriented Network Intelligence Collection (TONIC) is a problem which deals with acquiring maximum number of profiles in the online social network so as to maximize the information about a given target through these profiles. The acquired profiles, also known as leads in this paper, are expected to contain information which is relevant to the target profile. TONIC problem has been solved by modeling it as search problem and using heuristics to direct the best-first search on the social graph. The problem with this approach is that in case of dense neighbors of the target profile the computation of the heuristic can be significantly expensive. In this paper, we have introduced a k-beam search Heuristic which significantly mitigates this overhead.


Social network intelligence Heuristics search Targeted crawling Computation optimization Artificial intelligence search 


  1. 1.
    Bisgin, H., Agarwal, N., Xu, X.: World Wide Web 15, 213 (2012). Scholar
  2. 2.
    Stern, R., Samama, L., Puzis, R., Beja, T., Bnaya, Z.: TONIC: Target oriented network intelligence collection for the social web. In: 27th AAAI Conference on Artificial Intelligence, pp. 1184–1190 (2013)Google Scholar
  3. 3.
    Samama-kachko, L., Stern, R., Felner, A.: Extended framework for target oriented network intelligence collection. In: SoCS, pp. 131–138 (2014)Google Scholar
  4. 4.
    Target Oriented Network Intelligence Collection (TONIC) By: Liron Samama-Kachko Supervised by: Dr. Rami Puzis, Dr. Roni Stern (2014)Google Scholar
  5. 5.
    Bnaya, Z., Puzis, R., Stern, R., Felner, A.: Volatile multi-armed bandits for guaranteed targeted social crawling. In: Late Breaking Papers at the Twenty-Seventh AAAI Conference on Artificial Intelligence, pp. 8–10 (2013)Google Scholar
  6. 6.
    Bnaya, Z., Puzis, R., Stern, R., Felner, A.: Bandit algorithms for social network queries. In: Proceedings-SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013, pp. 148–153 (2013)Google Scholar
  7. 7.
    Xu, Z.W., Liu, F., Li, Y.X.: The research on accuracy optimization of beam search algorithm. In: 2006 7th International Conference on Computer-Aided Industrial Design and Conceptual Design, CAIDC. (2006).
  8. 8.
    Saini, C., Arora, V.: Information retrieval in web crawling: a survey. In: 2016 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2016, pp. 2635–2643 (2016).
  9. 9.
    Rawat, S., Patil, D.R.: Efficient focused crawling based on best first search. In: Proceedings of the 2013 3rd IEEE International Advance Computing Conference, IACC 2013, pp. 908–911 (2013).
  10. 10.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Phys. Rev. E 64, 046135 (2001)CrossRefGoogle Scholar
  11. 11.
    Paradise, A., Shabtai, A., Puzis, R., Elyashar, A., Elovici, Y., Roshandel, M., Peylo, C.: Creation and management of social network honeypots for detecting targeted cyber attacks. IEEE Trans. Comput. Soc. Syst. 4(3), 65–79 (2017)CrossRefGoogle Scholar
  12. 12.
    Paradise, A., Shabtai, A., Puzis, R.: Detecting organization-targeted socialbots by monitoring social network profiles. Netw. Spat. Econ. 1–31 (2018)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringVIT VelloreVelloreIndia
  2. 2.School of Information Technology and EngineeringVIT VelloreVelloreIndia

Personalised recommendations