skip to main content
10.1145/2661829.2661899acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Query-Driven Mining of Citation Networks for Patent Citation Retrieval and Recommendation

Published:03 November 2014Publication History

ABSTRACT

Prior art search or recommending citations for a patent application is a challenging task. Many approaches have been proposed and shown to be useful for prior art search. However, most of these methods do not consider the network structure for integrating and diffusion of different kinds of information present among tied patents in the citation network. In this paper, we propose a method based on a time-aware random walk on a weighted network of patent citations, the weights of which are characterized by contextual similarity relations between two nodes on the network. The goal of the random walker is to find influential documents in the citation network of a query patent, which can serve as candidates for drawing query terms and bigrams for query refinement. The experimental results on CLEF-IP datasets (CLEF-IP 2010 and CLEF-IP 2011) show the effectiveness of encoding contextual similarities (common classification codes, common inventor, and common applicant) between nodes in the citation network. Our proposed approach can achieve significantly better results in terms of recall and Mean Average Precision rates compared to strong baselines of prior art search.

References

  1. R. A. Baeza-Yates, F. Saint-Jean, and C. Castillo. Web structure, dynamics and page quality. In Proceedings of String Processing and Information Retrieval (SPIRE), pages 117--130, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Bashir and A. Rauber. Improving retrievability of patents in prior-art search. In Proceedings of ECIR, pages 457--470, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107--117, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. D'hondt, S. Verberne, C. H. A. Koster, and L. Boves. Text representations for patent classification. Computational Linguistics, 39(3):755--775, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Fujii. Enhancing patent retrieval by citation analysis. In Proceedings of SIGIR, pages 793--794, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Katz. Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech, and Signal Processing, 35(3):400--401, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  7. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604--632, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Lopez and L. Romary. Experiments with citation mining and key-term extraction for prior art search. CLEF (Notebook Papers/LABs/Workshops), 2010.Google ScholarGoogle Scholar
  9. M. Lupu and A. Hanbury. Patent Retrieval. Foundations and Trends in Information Retrieval, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Magdy and G. J. F. Jones. Applying the KISS principle for the CLEF-IP 2010 prior art candidate patent search task. CLEF (Notebook Papers/LABs/Workshops), 2010.Google ScholarGoogle Scholar
  11. W. Magdy and G. J. F. Jones. PRES: A score metric for evaluating recall-oriented information retrieval applications. In Proceedings of SIGIR, pages 611--618, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Mahdabi, L. Andersson, M. Keikha, and F. Crestani. Automatic refinement of patent queries using concept importance predictors. In Proceedings of SIGIR, pages 505--514, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Mahdabi, S. Gerani, J. X. Huang, and F. Crestani. Leveraging conceptual lexicon: Query disambiguation using proximity information for patent retrieval. In Proceedings of SIGIR, pages 113--122, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. M. Mimno and A. McCallum. Expertise modeling for matching papers with reviewers. In Proceedings of KDD, pages 500--509, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Oh, Z. Lei, W.-C. Lee, P. Mitra, and J. Yen. CV-PCR: a context-guided value-driven framework for patent citation recommendation. In Proceedings of CIKM, pages 2291--2296, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. F. Piroi, M. Lupu, A. Hanbury, and V. Zenz:. Clef-ip 2011: Retrieval in the intellectual property domain. In CLEF (Notebook Papers/Labs/Workshop), 2011.Google ScholarGoogle Scholar
  17. A. Stolcke. SRILM - an extensible language modeling toolkit. In Proceedings of ICSLP, pages 901--904, 2002.Google ScholarGoogle Scholar
  18. J. Tang, B. Wang, Y. Yang, P. Hu, Y. Zhao, X. Yan, B. Gao, M. Huang, P. Xu, W. Li, and A. K. Usadi. PatentMiner: topic-driven patent analysis and mining. In Proceedings of KDD, pages 1366--1374, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. W. Tang, J. Tang, T. Lei, C. Tan, B. Gao, and T. Li. On optimization of expertise matching with various constraints. Neurocomputing, 76(1):71--83, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Wu, J. Sun, and J. Tang. Patent partner recommendation in enterprise social networks. In Proceedings of WSDM, pages 43--52, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Yang and J. Leskovec. Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of WSDM, pages 587--596, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Yang, J. Tang, J. Keomany, Y. Zhao, J. Li, Y. Ding, T. Li, and L. Wang. Mining competitive relationships by learning across heterogeneous networks. In Proceedings of CIKM, pages 1432--1441, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. C. Zhai and J. D. Lafferty. A study of smoothing methods for language models applied to ad hoc information retrieval. In Proceedings of SIGIR, pages 334--342, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Query-Driven Mining of Citation Networks for Patent Citation Retrieval and Recommendation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
        November 2014
        2152 pages
        ISBN:9781450325981
        DOI:10.1145/2661829

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 November 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        CIKM '14 Paper Acceptance Rate175of838submissions,21%Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader