[논문]Graph kernel based measure for evaluating the influence of patents in a patent citation network

Rodriguez, A.; Kim, B.; Lee, J.M.; Coh, B.Y.; Jeong, M.K.

doi:10.1016/j.eswa.2014.08.051

Graph kernel based measure for evaluating the influence of patents in a patent citation network

Expert systems with applications, v.42 no.3, 2015년, pp.1479 - 1486

Rodriguez, A. , Kim, B. , Lee, J.M. , Coh, B.Y. , Jeong, M.K.

Abstract ▼ AI-Helper

Identifying important patents helps to drive business growth and focus investment. In the past, centrality measures such as degree centrality and betweenness centrality have been applied to identify influential or important patents in patent citation networks. How such a complex process like technological change can be analyzed is an important research topic. However, no existing centrality measure leverages the powerful graph kernels for this end. This paper presents a new centrality measure based on the change of the node similarity matrix after leveraging graph kernels. The proposed approach provides a more robust understanding of the identification of influential nodes, since it focuses on graph structure information by considering direct and indirect patent citations. This study begins with the premise that the change of similarity matrix that results from removing a given node indicates the importance of the node within its network, since each node makes a contribution to the similarity matrix among nodes. We calculate the change of the similarity matrix norms for a given node after we calculate the singular values for the case of the existence and the case of nonexistence of that node within the network. Then, the node resulting in the largest change (i.e., decrease) in the similarity matrix norm is considered to be the most influential node. We compare the performance of our proposed approach with other widely-used centrality measures using artificial data and real-life U.S. patent data. Experimental results show that our proposed approach performs better than existing methods.

주제어

참고문헌 (19)

Social Networks Borgatti 27 1 55 2005 10.1016/j.socnet.2004.11.008 Centrality and network flow

상세보기
Computational and Mathematical Organizational Theory Borgatti 12 21-34 2006 Identifying sets of key players in a social network
10.1137/1.9781611972733.4 Brand, M. (2003). Fast online svd revisions for lightweight recommender systems. In SIAM third international conference on data mining (pp. 37-46).
10.1109/ICDM.2006.18 Fouss, F., Yen, L., Pirotte, A., & Saerens, M. (2006). An experimental investigation of graph kernels on a collaborative recommendation task. In Sixth international conference on data mining (pp. 863-868).
Social Networks Freeman 1 215 1978 10.1016/0378-8733(78)90021-7 Centrality in social network: Conceptual clarification

상세보기
Kandola 657 2003 Proceedings of the neural information processing systems Learning semantic similarity
Scientometrics Kim 98 1811 2014 10.1007/s11192-013-1097-2 Inter-cluster connectivity analysis for technology opportunity discovery

상세보기
Kim Vol. 2 441 2012 On a patent analysis method for identifying core technologies
IEEE Transactions on Automation Science and Engineering Kim 9 4 723 2012 10.1109/TASE.2012.2210214 Automated detection of influential patents using singular values

상세보기
Journal of the ACM Kleinberg 46 5 604 1999 10.1145/324133.324140 Authoritative sources in a hyperlinked environment

상세보기
INFORMATION-An International Interdiscplinary Journal Kwon 12 4 875 2009 A method to make the genealogical graph of core documents from the directed citation network
Scientometrics Michel 51 1 185 2001 10.1023/A:1010577030871 Patent citation analysis. A closer look at the basic input data from patent search reports

상세보기
IEEE Transactions on Automation Science and Engineering Narayanam 8 1 130 2011 10.1109/TASE.2010.2052042 A Shapley value-based approach to discover influential nodes in social networks

상세보기
Newman 2010 Networks: An introduction
Physical Review Letters Noh 92 2004 Random walks on complex networks
Social Networks Opsahl 32 3 245 2010 10.1016/j.socnet.2010.03.006 Node centrality in weighted networks: Generalizing degree and shortest paths

상세보기
Rodriguez, A., Kim, B., Lee, J. -M., Coh, B. Y., & Jeong, M. K. (2014). Graph kernel based centrality measure for evaluating patent influence. Technical report, department of industrial and system engineering, Rutgers University.
Scientometrics Rousseau 11 3-4 217 1987 10.1007/BF02016593 The Gozinto theorem: Using citations to determine influences on a scientific publication

상세보기
Journal of Marketing Sood 69 152 2005 10.1509/jmkg.69.3.152.66361 Technological evolution and radical innovation

상세보기

LOADING...

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증

Graph kernel based measure for evaluating the influence of patents in a patent citation network

Abstract ▼ AI-Helper

주제어

참고문헌 (19)

이 논문을 인용한 문헌

연구과제 타임라인

관련 콘텐츠

이 논문과 함께 이용한 콘텐츠

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트

연합인증

Graph kernel based measure for evaluating the influence of patents in a patent citation network

Abstract ▼ AI-Helper

주제어

참고문헌 (19)

이 논문을 인용한 문헌

연구과제 타임라인

전체(0) 논문(0) 특허(0) 보고서(0)

전체(0) 논문(0) 특허(0) 보고서(0)

관련 콘텐츠

이 논문과 함께 이용한 콘텐츠

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트