Skip to main content
SpringerLink
Log in

RETRACTED ARTICLE: Query expansion for patent retrieval using a modified stellar-mass black hole optimization

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

This article was retracted on 16 June 2022

This article has been updated

Abstract

Query expansion is an approach, which plays a critical role on the web-based search and retrieval methods. It’s primary objective is to expedite the performance of the retrieval process in retrieving information by merging alternate word forms in the original query. The related word forms are retrievable from the document available in databases, which stores documents with a high density. A typical method for query expansion involves clustering of related documents and extracting closely related expressions using these clusters. However, traditional clustering poses a few problems to query expansion. Biclustering appears to be more effective in query expansion than traditional clustering. Recently a nature-inspired algorithm, namely the stellar mass black hole optimization has been introduced, to carry out the process of biclustering. Modification of the SBO has been performed to propose MSBO. Preliminary results have shown that the proposed modified stellar mass black hole (MSBO) method effectively clusters identical expressions and consequently the detected biclustering algorithms were effective in generating suitable words for expanding a given query. The MSBO has been tested on particular sets of documents with the objective of identifying groups of relevant categories of text that form the biclusters. Thus the proposed MSBO proves to be an effective query expansion tool. Based on the analysis of the obtained results, and on the comparisons performed with the existing methods, it has been found that MSBO is effective in generating results that are encouraging.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Change history

References

  • Abass OA, Folorunso O, Samuel BO (2017) Automatic query expansion for information retrieval: a survey and problem definition. Am J Comput Sci Inf Eng 4(3):24–30

    Google Scholar 

  • Abdulla AAA, Lin H, Xu B, Banbhrani SK (2016) Improving biomedical information retrieval by linear combinations of different query expansion techniques. BMC Bioinform 17(7):238

    Article  Google Scholar 

  • Al-Chalabi H, Ray S, Shaalan K (2015) Semantic based query expansion for arabic question answering systems. In: First international conference onarabic computational linguistics (ACLing)

  • Azad HK, Deepak A (2019) Query expansion techniques for information retrieval: a survey. Inf Process Manag 56(5):1698–1735

    Article  Google Scholar 

  • Balamurugan R, Premalatha K (2015) Stellar-mass black hole optimization for biclustering microarray gene expression data. Appl Artif Intell 29(4):353–381

    Article  Google Scholar 

  • Balamurugan R, Natarajan AM, Premalatha K (2016) Biclustering microarray gene expression data using modified Nelder–Mead method. Int J Inf Commun Technol 9(1):43–63

    Google Scholar 

  • Chang CH, Hsu CC (1999) Enabling concept-based relevance feedback for information retrieval on the WWW. IEEE Trans Knowl Data Eng 11(4):595–609

    Article  Google Scholar 

  • Cheng and Church (2000) Biclustering of expression data: international conference on intelligent systems for molecular biology

  • Cui H, Wen JR, Nie JY, Ma WY (2002) Probabilistic query expansion using query logs. In: Proceedings of the 11th international conference on World Wide Web, pp 325–332

  • Davis M, Efstathiou G, Frenk CS, White SD (1985) The evolution of large-scale structure in a universe dominated by cold dark matter. Astrophys J 292:371–394

    Article  Google Scholar 

  • de Castro PAD, de Franca FO, Ferreira HM, Coelho GP, VonZuben FJ (2009) Query expansion using an immune-inspired biclustering algorithm. Springer, Berlin

    Google Scholar 

  • Dutt A, Ismail MA, Herawan T (2017) A systematic review on educational data mining. IEEE Access 5:15991–16005

    Article  Google Scholar 

  • Ksentini N, Tmar M, Gargouri F (2015) Controlled automatic query expansion based on a new method arisen in machine learning for detection of semantic relationships between expressions. In: 15th International conference on intelligent systems design and applications (ISDA)

  • Liu Y, Li C, Zhang P, Xiong Z (2008) A query expansion algorithm based on phrases semantic similarity. In: International symposiums on information processing (ISIP)

  • Michalski RS, Stepp RE (1983) Learning from observation: conceptual clustering. In: Machine learning. Springer, pp 331–363

  • Michell J, Laplace PS (1998) Black holes: a general introduction, vol 514. Black holes: theory and observation lecture notes in physics. Springer, Berlin, pp 3–34

    Google Scholar 

  • Nguyen N-V, Boucher A, Ogier J-M, Tabbone S (2012) Cluster-based relevance feedback for CBIR: a combination of query point movement and query expansion. J Ambient Intell Humaniz Comput 3:281–292

    Article  Google Scholar 

  • Patel S, Bhatt N, Shah C (2017) Query expansion for effective retrieval from microblog. In: International conference on computing methodologies and communication (ICCMC)

  • Peat HJ, Willett P (1991) The limitations of term co-occurrence data for query expansion in document retrieval systems. J Am Soc Inf Sci 42(5):378

    Article  Google Scholar 

  • Premalatha K, Balamurugan R, Kannimuthu S (2017) Stellar mass black hole for engineering optimization. In: Handbook of recent developments in intelligent nature-inspired computing. IGI Global book series Advances in computational intelligence and robotics (ACIR), USA, pp 62–90. ISBN: 978-1-5225-2322-2

  • Puspitaningrum D, Yulianti G, Prasetya ISWB (2017) Wiki-meta semantik: a wikipedia-derived query expansion approach based on network properties. In: 5th International conference cyber and IT service management (CITSM)

  • Rivas AR, Iglesias EL, Borrajo L (2014) Study of query expansion techniques and their application in the biomedical information retrieval. Sci World J. https://doi.org/10.1155/2014/132158

    Article  Google Scholar 

  • Sharma DK, Pamula R, Chauhan DS (2019) A hybrid evolutionary algorithm based automatic query expansion for enhancing document retrieval system. J Ambient Intell Human Comput. https://doi.org/10.1007/s12652-019-01247-9

    Article  Google Scholar 

  • Shen X, Tan B, Zhai CX (2005) Context-sensitive information retrieval using implicit feedback. In: Proceedings of the 28th annual international ACM SIGIR conference on research and development in information retrieval, pp 43–50. ACM

  • Šilić A, Moens MF, Žmak L, Bašić BD (2008) Comparing document classification schemes using k-means clustering. In: International conference on knowledge-based and intelligent information and engineering systems. Springer, Berlin, pp 615–624

  • Singh J, Prasad M, Daraghmi YA, Tiwari P, Yadav P, Bharill N, Pratama M, Saxena A (2017) Fuzzy logic hybrid model with semantic filtering approach for pseudo relevance feedback-based query expansion. In: IEEE symposium series on computational intelligence (SSCI)

  • Sparck Jones K (1971) Automatic keyword classification for information retrieval. Butterworths, London

    Google Scholar 

  • Wang F, Lin L (2016) Domain lexicon-based query expansion for patent retrieval. In: 12th International conference natural computation, fuzzy systems and knowledge discovery (ICNC-FSKD)

  • Wheeler JA (2000) Exploring black holes: introduction to general relativity. Addison Wesley, United States

    Google Scholar 

  • Willet P (1988) Recent trends in hierarchic document clustering: a critical review. Inf Process Manag 24(5):577–597

    Article  Google Scholar 

  • Wu H, Li J, Kang Y, Zhong T (2018) Exploring noise control strategies for UMLS-based query expansion in health and biomedical information retrieval. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-018-0836-x

    Article  Google Scholar 

  • Xu J, Bruce Croft W (1996) Query expansion using local and global document analysis. SIGIR96, Zurich, Switzerland@ ACM 0-89791-792- 8/96/08

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, College of Engineering, Guindy, Chennai, India

    G. David Raj

  2. Department of Information Science and Technology, College of Engineering, Guindy, Chennai, India

    Saswati Mukherjee, G. V. Uma & R. L. Jasmine

  3. School of Computer Science and Engineering (SCOPE), Vellore Institute of Technology, Vellore, India

    R. Balamurugan

Authors
  1. G. David Raj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saswati Mukherjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. V. Uma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. L. Jasmine
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. R. Balamurugan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. David Raj.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article has been retracted. Please see the retraction notice for more detail: https://doi.org/10.1007/s12652-022-04125-z

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

David Raj, G., Mukherjee, S., Uma, G.V. et al. RETRACTED ARTICLE: Query expansion for patent retrieval using a modified stellar-mass black hole optimization. J Ambient Intell Human Comput 12, 4841–4853 (2021). https://doi.org/10.1007/s12652-020-01894-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-01894-3

Keywords

Search

Navigation