<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Mining Technical Topic Networks from Chinese Patents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hongqi Han</string-name>
          <email>bithhq@163.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xiaodong Qiao</string-name>
          <email>qiaox@istic.ac.cn</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shuo Xu</string-name>
          <email>xush@istic.ac.cn</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jie Gui</string-name>
          <email>guij@istic.ac.cn</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lijun Zhu</string-name>
          <email>zhulj@istic.ac.cn</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhaofeng Zhang</string-name>
          <email>zhangzf@istic.ac.cn</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Scientific and, Technical Information of China</institution>
          ,
          <addr-line>Fuxing road 15, haidian, district(100038), Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Scientific and, Technical Information of China</institution>
          ,
          <addr-line>Fuxing road 15, haidian, district(100038), Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Institute of Scientific and, Technical Information of China</institution>
          ,
          <addr-line>Fuxing road 15, haidian, district(100038), Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Institute of Scientific and, Technical Information of China</institution>
          ,
          <addr-line>Fuxing road 15, haidian, district(100038), Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Institute of Scientific and, Technical Information of China</institution>
          ,
          <addr-line>Fuxing road 15, haidian, district(100038), Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>School of Information</institution>
          ,
          <addr-line>Management, Nanjing</addr-line>
          ,
          <institution>University</institution>
          ,
          <addr-line>22 Hankou Road, Nanjing, Jiangsu (210093), Nanjing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Patents are one of the most important innovative resources. It is a challenge and useful to discover technical topics and their relations from patents. A process framework is proposed to mine technical topics and construct their relation network from Chinese patents. The process consists of four stages. First, technical terms are extracted from patent texts and the equivalence index is selected to measure the link strength between them. Then, a clustering algorithm is used to group terms into topic clusters, in which terms are connected by internal links, and topic clusters are connected by external links. Afterwards, all topics are classified into three categories: isolated, principal and secondary. Finally, a technical topic network is created by using topic clusters as nodes, external links as edges and the number of external links as weights. Experimental results on Chinese fuel cell patents show the method is effective in mining technical topics and mapping their relations, and the constructed network is helpful for technology innovation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Categories and Subject Descriptors</title>
      <p>H.4 [Information Systems Applications]: Data Mining
; I.2 [Computing methodologies]: Artificial Intelligence
Application
Technical topic network, topic relation, co-word analysis, patent
analysis, data mining
Copyright c 2014 for the individual papers by the papers’ authors.
Copying permitted for private and academic purposes. This volume
is published and copyrighted by its editors. Published at Ceur-ws.org
Proceedings of the First International Workshop on Patent Mining and
Its Applications (IPAMIN) 2014. Hildesheim. Oct. 7th. 2014. At
KONVENS’14, October 8´lC10, 2014, Hildesheim, Germany.
.
1.</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>
        Today, along with the rapid development of science and
technology and integration of economic globalization process, innovation
is becoming an important means to obtain technological
advantage[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Patent documents are one of the major innovative data
resources of technical and commercial knowledge, and thus patent
analysis has long been considered helpful for R&amp;D management
and technoeconomic analysis[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. By depicting technical topics
and mapping their relations, researchers can acquire novel ideas
for technology breakthrough, while enterprises can find technical
routes for product planning and development, and policy makers
can understand dynamic technology change for funding emerging
and potential fields. Traditionally, a small number of experts are
selected to undertake such work, yet the method has been widely
criticized, such as weak representativeness, high cost, and low
efficiency [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        It is a challenge to detect technical topics and find the relations
between them. On the one hand, rapid developing technology
makes it difficult for researchers to grasp the latest topics, on
the other hand the amount of patents is huge and increasing
sharply, which also makes it difficult to mine technical topics
hidden in the data. Yoon [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and Lee [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] proposed approaches
for identifying new technology opportunities using keyword-based
morphology analysis and keyword-based patent maps respectively.
Yoon [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] presented a network analysis for high technology
trend forecast based on text mining technique, where nodes of the
network are patents. However, these previous researches didn’t
explore technology topics and map their relations. Callon [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
presented co-word analysis techniques to map the relationship
between concepts, ideas and problems in science. The following
researches, for example, Coulter [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], Van [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and Cobo [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
extended the technique. Now it is common to find scientific papers
and reports that contain a science mapping analysis to show and
uncover the hidden key elements [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], however most of these works
were undertaken for academic purposes using bibliographic data,
and few are for competitive animus using patent data.
      </p>
      <p>In this article, we propose an approach based on co-word
analysis technique for detecting technical topics and mapping their
relations using patent data. The co-word analysis technique is
based on keywords and their co-occurrence, however most patent
databases don’t provide keywords, therefore one of the challenges
is to extract technical terms from patents. To extract terms from
patent text, we use a hybrid automatic term recognition technique
integrating linguistic rules and statistics indexes. Another
challenge comes from the way to detect topics in patents, because
technical topics and their numbers are usually unknown. The
presented approach is a process framework consisting of four steps.
The first step is data collection and pre-processing, the second step
is extracting technical terms, the third step is detecting technical
topics, and the last step is constructing technical topic network.</p>
      <p>The remainder of the article is organized as follows. In section
2, the process framework is illustrated to introduce the basic idea
to create topic network. In section 3, the main techniques used in
the article are introduced. In section 4, an experimental results on
Chinese fuel cell patents are described and discussed. Finally, the
conclusion are made.</p>
    </sec>
    <sec id="sec-3">
      <title>METHODS</title>
      <p>The process framework of the presented method is first
introduced. Then three core techniques in the framework are introduced,
including technical terms extraction, topic detection, and topic
network construction.
2.1</p>
    </sec>
    <sec id="sec-4">
      <title>Framework</title>
      <p>The process framework contains four continuous stages (Fig.1):
patent data collection and pre-processing, technical terms
extraction, topic detection and topics network construction. In the first
stage, patent data are collected and stored into database after
preprocessing operations. In the second stage, technical terms are
extracted from patent text. In the third stage, terms are clustered
into technical topics. In the last stage, topic clusters are used to
create network based on their link relations.
2.2</p>
    </sec>
    <sec id="sec-5">
      <title>Technical Terms Extraction</title>
      <p>
        unithood refers to the degree of strength or stability of syntagmatic
collocations[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Afterwards, the candidate terms are sorted
according to the statistics index and evaluated by domain experts, and
finally, selected technical terms are stored for co-word analysis.
2.3
      </p>
    </sec>
    <sec id="sec-6">
      <title>Topics Detection</title>
      <p>
        After technical terms are extracted, keyword network can be
constructed based on their co-occurrence relation, however such
network contains so many nodes and complex relations that it can’t
be better understood [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Therefore, Callon [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] presented a method
to cluster keywords into topics, in which several keywords are
closely connected. Each topic represents an interested problem of
researchers, and so it will be more easily understood than single
keywords. Moreover, the number of topics is far less than that of
keywords, which makes it clearer to map the relations of concepts.
      </p>
      <p>
        To measure the link strength is an important process for detecting
topics. Many metrics have been proposed for computing the
link relations between keywords. The common indexes include
association strength [
        <xref ref-type="bibr" rid="ref12 ref4">4, 12</xref>
        ], Equivalence Index [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Inclusion
Index[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Jaccard Index [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and Salton.s cosine [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Among
these indexes, the Equivalence index shows the probability that
two keywords co-occur when given the frequency of two keywords
appearing in documents. It provides an intuitive measure of
link strength between keywords, rather than imposing conceptual
inclusion property like other metrics. Moreover, the metric is easier
to be understood and utilized in the production and interpretation
of keyword association maps than other metrics [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. It also allows
associations of both major and minor keywords and is symmetrical
in their relationships [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Let Ci be the number of times keyword i
is used in the corpus, and let Cij be the number of co-occurrences
of keyword i and j. The link strength Eij between keyword i and
j is given by Eq. 1:
2
Eij = (Cij /Ci) × (Cij /Cj ) = Cij /(Ci × Cj )
(1)
      </p>
      <p>Based on link strength, research topics in a domain corpus
can be detected using keywords clustering algorithm. The main</p>
      <sec id="sec-6-1">
        <title>Full Text of</title>
      </sec>
      <sec id="sec-6-2">
        <title>Patent</title>
      </sec>
      <sec id="sec-6-3">
        <title>Word</title>
      </sec>
      <sec id="sec-6-4">
        <title>Segmentation</title>
      </sec>
      <sec id="sec-6-5">
        <title>POS Tagger</title>
      </sec>
      <sec id="sec-6-6">
        <title>Phrase collocation</title>
      </sec>
      <sec id="sec-6-7">
        <title>Term candidates</title>
      </sec>
      <sec id="sec-6-8">
        <title>Term evaluation</title>
      </sec>
      <sec id="sec-6-9">
        <title>Technical Terms</title>
      </sec>
      <sec id="sec-6-10">
        <title>Linguistic rules filter</title>
      </sec>
      <sec id="sec-6-11">
        <title>Stop-word list filter</title>
        <p>
          effective clustering algorithms include Callon’s method [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ],
Coulter’s method [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], Multidimensional Scaling (MDS) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], Latent
Dirichlet Allocation (LDA ) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and others.
        </p>
        <p>
          This study uses the two passes algorithm proposed by Coulter
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Pass-1 builds keywords clusters that can identify areas of
strong focus as research topics. The nodes with big circular shape
in Fig.3 show such topics. The internal nodes with triangle shape
in a topic node represent strongly connected keywords. The links
between keywords in a topic are called internal links. Pass-2
identifies keywords that associate in more than one topics, and
thereby generates links between Pass-1 nodes across topics and
indicate pervasive issues. The links between keywords in different
topics are called external links (Fig.3).
        </p>
        <p>
          Denote the set of detected topics as T = {t1, t2, ..., tm}, where
m is the number of topics. Then for a topic, tl, where l ∈ [1, m],
denote the equivalence index of internal link between keywords
ki and kj as Eij , where i, j ∈ [1, n], and n is the number of
keywords in topic tl. Learning from Callon [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and Coulter [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ],
we use Eq.2 and Eq.3 to define two indexes: ceiling and saturation.
For each topic, ceiling measures the maximum link strength (Eq.2),
and saturation measures the minimum link strength (Eq.3).
        </p>
        <p>ceiling(tl) = max(Eij)
saturation(tl) = min(Eij )
(2)
(3)</p>
        <p>Next, considering the external links and their association values,
all the topic clusters can be classified into three categories: isolated,
secondary, principal.</p>
        <p>• isolated topics: which have no external links with other
topics, or the numbers of external links between which
and other topics are below threshold, so the only question
regarding them is their internal homogeneity;
• secondary topics: the strength values of external links
between which and other clusters are above the ceiling
threshold, and so it is naturally considered that they are the
extension of one of these;
• principal topics: whose saturation values are greater than
links associated to one or more other (secondary) clusters.</p>
        <p>According to such classification, principal topics seem to be
basic technologies for some other ones, and secondary topics seem
to be dependant technologies on basic ones, while isolated topics
seem to be independent technologies.
2.5</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Topics Network Construction</title>
      <p>Based on the classification of topic clusters, using detected topics
as nodes, the external links as edges, and the numbers of external
links as weights of edges, the topics network is constructed to
illustrate the relations between topics. We don’t use multiple edges
to represent the relations between two topics. That is to say, if two
topic clusters have external links, even when the number of external
links are greater than 1, there is a single edge between them. In
practice, a threshold of minimum number of external links is used
to remove weaker connected edges for getting better results. In
order to illustrate the relation between two topics, the classification
information is used to decide the direction of edges. The direction
of edges between principal and secondary topics are unidirectional,
from the former to the latter, while the edges between two principal
topics are bidirectional.
3.
3.1</p>
    </sec>
    <sec id="sec-8">
      <title>EXPERIMENTS</title>
    </sec>
    <sec id="sec-9">
      <title>Data</title>
      <p>The experimental data is provided by SIPO (http://www.sipo.gov.cn).
Chinese patents in the domain of fuel cell are collected using the
retrieval strategy combining keywords and IPC codes. All collected
patents are pre-precessed. Finally, we get 6,346 patents. Because
the full text of patents are not provided, we just use title and abstract
to extract terms in the experiment.
3.2</p>
    </sec>
    <sec id="sec-10">
      <title>Technical terms</title>
      <p>
        First, Chinese word segmentation tools are run to split sentences
in patent title and abstract into words. Let the threshold of term
frequency be 2, we get 28,113 candidate terms. All single words
are eliminated, because single words alone are often too general in
meanings or ambiguous to represent a concept in patent analysis,
while multi-word phrases can be more specific and desirable[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
Then the termhood and unithood of all candidates are computed
? + N ? + cluster, the name of which is " ·-6 ·"
      </p>
      <p>
        With the extracted 1,123 technical terms, we use the method in
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to detect topic clusters. The parameters used to generate topic
clusters are shown in Table 3.
      </p>
      <p>
        We get 62 topics totally. All the topics are numbered, ranging
from 1 to 62 according to the generation sequence. The first
generated topic is assigned number 1 and the last one is assigned
number 62. The name of each topic is the internal terms with high
degrees. Fig. 4 shows the internal structure of first detected topic
(Hydrogen outlet pipeline-liquid outlet pipeline).
using the methods in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Afterwards, let the threshold of termhood
and unithood be their mean value, and the threshold of document
frequency be 5, we get 1,669 technical terms. Finally, 1,123 terms
are selected after the evaluation process of domain experts for
detecting topics and creating network.
      </p>
      <p>Detected topics are used to construct networks (Fig. 5). In
the network, nodes are detected topics, edges are external links
between them. Isolated topics are not shown. With the information
provided by the network, we can not only understand the relation
between topics but also find out the structure of domain technology.</p>
      <p>In Fig. 5, the value of parameter Minimum External Links is set
4, i.e. only when the number of external links between any two
topics are greater than 4, there is an edge between them. Under
such condition, there are 10 sub-domain technology. Each
subdomain technology is composed of several connected topics. In a
sub-domain technology, the importance of each topic is different.
For example, in the sub-domain technology which contains topic 2,
topic 24 is the joint of topic 2, 22, 24, 30, 39 and 48, so it may play
an essential role in the transformation of the network. Such topics
are called crossroads clusters. By identifying them, we can find the
important technology in the domain.</p>
      <p>In Fig. 5, the arrow direction of an edge shows the extension
relation between two topics. The topic nodes in the heads of
arrows are secondary clusters, while the topic nodes in the tails
are principal clusters. As stated before, the secondary clusters are
extensions from principal clusters. In the figure, the sizes of nodes
represent the patent numbers related to a topic. If a term in a topic
occurs in a patent, the patent is related to the topic. Therefore,
from the figure, we know topic 1 is the most preferred developed
technology in the domain of fuel cell. This gives useful information
to find the popular technologies in the domain.
4.</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSION</title>
      <p>A method based on co-word analysis technique is presented to
detect domain research topics and their link relations from Chinese
patents. Because keywords are not provided in patent data, the
method extracts terms from free text data in title and abstract. The
term extraction technique integrates linguistic rules and statistics
indexes. Extracted terms are clustered into topic clusters based
on equivalence index. Internal links and external links are defined
to classified all topic clusters into three categories, viz. isolated,
secondary and principal clusters. Using topic clusters as nodes,
external links as edges, the number of external links as weights,
the technical topic graph is created. Experimental results on fuel
cell patents show that it can map the relation of topics, and find
important research topics.</p>
      <p>Although the method is designed for Chinese patents, it is also
applicable for other patent data, like USPTO and EPO. However,
the discovered topics in the method are based on links, and we limit
the number of keywords in clustered topics. In addition, threshold
values, such as document frequency and maximum external link
number in the experimental part is too naive. These human factors
will affect the clustering result, and maybe the topic clusters can
not cover relative technical terms. In the future, we will try more
specific methods to detect research topics for generating network,
such as topic models based on statistics technology. In the theory
of co-word analysis, it is difficult to evaluate the accuracy of
topic selection and the effectiveness of topic network. Although
we believe researchers will be inspired with the topic network
in technology innovation, the reliability of the method should be
considered in the future.</p>
    </sec>
    <sec id="sec-12">
      <title>Acknowledgments</title>
      <p>The authors are grateful to Hailiang Technology Company for
providing the Chinese word segmentation software for this
research. This research was funded partially by "The study on the
disconnected problem of scientific collaboration network" which is
sponsored by ISTIC Pre-research Foundation under grant number
YY–201418 , the Key Technologies R&amp;D Program of Chinese 12th
Five-Year Plan (2011-2015): Key Technologies Research on Data
Mining from the Multiple Electric Vehicle Information Sources
under grant number 2013BAG06B01, and Key Technologies
Research on Mining and Discovery from Patent Resources under grant
number 2013BAH21B02. Authors are grateful to the Ministry of
Science and Technology of China for financial support to carry out
this work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. I.</given-names>
            <surname>Jordan</surname>
          </string-name>
          .
          <article-title>Latent dirichlet allocation</article-title>
          .
          <source>the Journal of machine Learning research</source>
          ,
          <volume>3</volume>
          :
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Callon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Courtial</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Laville</surname>
          </string-name>
          .
          <article-title>Co-word analysis as a tool for describing the network of interactions between basic and technological research: The case of polymer chemsitry</article-title>
          .
          <source>Scientmetrics</source>
          , (
          <volume>22</volume>
          ):
          <fpage>155</fpage>
          -
          <lpage>205</lpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cobo</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>L_pez-</article-title>
          <string-name>
            <surname>Herrera</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Herrera-Viedma</surname>
            , and
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Herrera</surname>
          </string-name>
          .
          <article-title>Scimat: A new science mapping analysis software tool</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          ,
          <volume>63</volume>
          (
          <issue>8</issue>
          ):1609ı1630,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Coulter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ira</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Suresh</surname>
          </string-name>
          .
          <article-title>Software engineering as seen through its research literature: a study in co-word analysis</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          ,
          <volume>49</volume>
          (
          <issue>13</issue>
          ):
          <fpage>1206</fpage>
          -
          <lpage>1223</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Q. H.</surname>
          </string-name>
          <article-title>Knowledge discovery through co-word analysis library trends</article-title>
          .
          <source>Library trends</source>
          ,
          <volume>48</volume>
          (
          <issue>1</issue>
          ):
          <fpage>133</fpage>
          -
          <lpage>159</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Han</surname>
          </string-name>
          and
          <string-name>
            <given-names>X.</given-names>
            <surname>An</surname>
          </string-name>
          .
          <article-title>Chinese scientific and technical term extraction using c-value and unithood measure</article-title>
          .
          <source>Library and Information Service</source>
          ,
          <volume>56</volume>
          (
          <issue>19</issue>
          ):
          <fpage>85</fpage>
          -
          <lpage>89</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kageura</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Umino</surname>
          </string-name>
          .
          <article-title>Methods of automatic term recognition: A review</article-title>
          .
          <source>Terminology</source>
          ,
          <volume>3</volume>
          (
          <issue>2</issue>
          ):
          <fpage>259</fpage>
          -
          <lpage>289</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          and
          <string-name>
            <surname>D. H.</surname>
          </string-name>
          <article-title>Technological innovation of high-tech industry and patent policy-agent based simulation with double loop learning c,intelligent agents:specification,modeling and applications</article-title>
          .
          <source>In Proceedings of 4th Pacific Rim International Workshop on Multi-agents,PRIMA</source>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lee</surname>
          </string-name>
          , ByungunYoon, and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          .
          <article-title>An approach to discovering new technology opportunities: Keyword-based patent map approach</article-title>
          . Technovation,
          <volume>29</volume>
          :
          <fpage>481</fpage>
          -
          <lpage>497</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Peters</surname>
          </string-name>
          and
          <string-name>
            <surname>A. F. van Raan.</surname>
          </string-name>
          <article-title>Co-word-based science maps of chemical engineering. part i: Representations by direct multidimensional scaling</article-title>
          .
          <source>Research Policy</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>23</fpage>
          -
          <lpage>45</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Tseng</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Lin</surname>
            , and
            <given-names>Y.-I.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>Text mining techniques for patent analysis</article-title>
          .
          <source>Information Processing &amp; Management</source>
          ,
          <volume>43</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1216</fpage>
          -
          <lpage>1247</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N. J. Van</given-names>
            <surname>Eck</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Waltman</surname>
          </string-name>
          .
          <article-title>Bibliometric mapping of the computational intelligence field</article-title>
          .
          <source>International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems</source>
          ,
          <volume>15</volume>
          (
          <issue>05</issue>
          ):
          <fpage>625</fpage>
          -
          <lpage>645</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ying</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. G. G.</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Schubert</surname>
          </string-name>
          .
          <article-title>Bibliometric cartography of information retrieval research by using co-word analysis</article-title>
          .
          <source>Information Processing &amp; Management</source>
          ,
          <volume>37</volume>
          (
          <issue>6</issue>
          ):
          <fpage>817</fpage>
          -
          <lpage>842</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B.</given-names>
            <surname>Yoon</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          .
          <article-title>A text-mining-based patent network:analytic tool for high-technology trend</article-title>
          .
          <source>The Journal of High Technology Management Research</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ):
          <fpage>37</fpage>
          -
          <lpage>50</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>B.</given-names>
            <surname>Yoon</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          .
          <article-title>A systematic approach for identifying technology opportunities: Keyword-based morphology analysis</article-title>
          .
          <source>Technological Forecasting &amp; Social Change</source>
          ,
          <volume>72</volume>
          :
          <fpage>145</fpage>
          -
          <lpage>160</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>