<!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>Visualizing Query Comparisons in Patent Retrieval Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Natural Language Processing</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Hildesheim Universitätsplatz 1 - 31141 Hildesheim</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Patent retrieval is a very complex process where users need to be supported in order to finish their tasks efficiently and effectively. There are many tasks in the process that can benefit from such tools, one being the phase of query formulation. Being a highly manual task, it is only possible to precompute possible helpful data and to then visualize it for the user. The process of querying and the pertaining results of information retrieval systems can be visualized in many ways. We present two prototypical system designs for comparing the queries in patent retrieval. The prototypes include elements of the query structure as well as the results set size. Both are crucial elements for patent experts to explore the effect of changes in a query. Our system supports the stepwise optimization of complex queries in patent searches. The design ideas are based on knowledge engineering with domain experts.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Patent Retrieval</kwd>
        <kwd>Information Retrieval</kwd>
        <kwd>User Centered Design</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Visualization,
Information</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>Patents are one of the most important sources for recent
technology information. Over 2 million new patents are registered
worldwide with high growth rates especially in Asia nowadays.
The retrieval of relevant information from patents is of crucial
importance for investments of enterprises.</p>
      <p>In this paper, we analyze the role of information visualization in
patent retrieval and present how the field can benefit from visual
Copyright © 2015 for the individual papers by the papers' authors.
Copying permitted for private and academic purposes.</p>
      <p>This volume is published and copyrighted by its editors
Published at CEUR-WS.org
Proceedings of the 2nd International Workshop on Patent Mining and Its
Applications (IPaMin 2015). Beijing, May. 27-28, 2015.
tools. Two concrete prototypical visualizations are suggested.
They were gained by using a user-centered development
approach.</p>
      <p>The paper is structured as follows. Section 2 gives a short
introduction into patent information retrieval and explains the
motivation for our prototypes. In Section 3, the field of
information visualization is described and the potential for patent
retrieval tasks is highlighted. Related work is presented in Section
4. Our prototypes are described in Section 5 before concluding the
paper in Section 6.</p>
    </sec>
    <sec id="sec-3">
      <title>2. PATENT INFORMATION</title>
    </sec>
    <sec id="sec-4">
      <title>RETRIEVAL</title>
      <p>Patent retrieval differs from other retrieval processes in several
ways [Lupu et al. 2011]. Of particular importance is the
professional character of patent searches which emphasizes
diligence and which leads to complex queries. Patent queries can
be one page long and may encompass many fields and may
contain dozens of parameters. The development and maintenance
of such a query strategy requires elaboration and iterative
optimization [Bonino 2010].</p>
      <p>One way to support the complexity for patent searchers is the
implementation and integration of more value-added components
like trend analysis [Kim et al. 2009] or network analysis [Han
2014], advanced linguistic analysis [Becks 2013] or even
forecasting and predictive analysis [Jung &amp; Ha 2015].
Currently, approaches taking a broader view at search processes
and information behavior [Widen et al. 2014] are applied also to
patent retrieval. A behavior model was developed which takes
into account the phases of patent retrieval processes by patent
experts [Jürgens &amp; Womser-Hacker 2014].</p>
      <p>
        This model defines and explains the following seven
subprocesses of patent retrieval: Recognize/Accept, Define Problem,
Select Database, Formulate Query, Examine Results, Extract
Info/Report, Reflect/Stop. The iterative character is clarified by
the many arrows between the sub-phases. Jürgens &amp;
WomserHacker (
        <xref ref-type="bibr" rid="ref6 ref9">2014</xref>
        ) further highlight the difficulties in these steps. The
query formulation phase e.g. is one of the most critical tasks in the
process since the problem needs to be translated into a query. The
quality of the query is highly dependent on the expertise and the
experience of the patent searcher. This means that automatic
approaches alone fall short during this step, they can only be a
means for inspiration. Systems therefore need to deliver
precomputed data which then has to be presented to the user so
(s)he can further interact with it to be able to make better
decisions. A field that is concerned with exactly such a scenario is
information visualization.
      </p>
    </sec>
    <sec id="sec-5">
      <title>3. INFORMATION VISUALIZATION</title>
      <p>Visualization intends to make data more easily understandable for
humans. By making use the tremendous visual processing
capabilities of human brains, system engineers can present more
data than in textual or numerical modes.</p>
      <p>Visualizations can be applied either as a presentation tool to
communicate ideas, explain data or provide support or they can be
used for analysis where very complex data is illustrated and users
can make use of a variety of interaction techniques. Especially
this latter use of visualizations can lead to a dialog between the
analyst and the data that promotes exploration and learning.
Visualization is thus helpful in gaining insights, not only in the
meaning of spontaneous “aha”-moments but also from the
perspective of knowledge building [Chang et al. 2009].
In patent retrieval, both forms of visualizations can be of avail. In
some search scenarios (like the state-of-the-art search), it is
sufficient to get a general understanding of the field. Here,
visualizations that give the user an overview, e.g. over the top
inventors or technologies, can be valuable. In other situations (like
the validity search), a large number of patents needs to be
examined in depth to extract the relevant passages. Here, visual
tools that support this analytical task could be applied. In critical
scenarios, the visual exploration of similar patents is also
imaginable. The use cases for visualizations during complex
patent searches are numerous. Visualizations currently offered in
patent search systems and discussed in research are described in
the next section.</p>
    </sec>
    <sec id="sec-6">
      <title>4. RELATED WORK:</title>
    </sec>
    <sec id="sec-7">
      <title>VISUALIZATION IN PATENT RETRIEVAL</title>
      <p>Patent retrieval systems on the market integrate more and more
visualization techniques. They mostly integrate classical diagrams
and presentation techniques into the result analysis (see Figure 1).
Some software products also contain more sophisticated
visualizations such as 3D-landscapes (see Figure 2).</p>
      <p>Independent from their specific visualizations, all systems focus
on the presentation of result sets so that the potential of
visualization for the retrieval process is often not fully exploited.
On the one side, research concerning the use of visualizations in
patent systems is rather limited. On the other side, very different
applications for visualizations have been examined, ranging from
the presentation of the whole patent space to result set
visualization and visualizations that should ultimately help users
with improving their search queries.</p>
      <p>
        Kutz (2004) used treemaps to visualize all patents of the USPTO
archive between 1976 and 2002 on the basis of their 466 IPC
classes. The data set was examined in 5 year intervals. The colors
of the classes comply with the percental change in the number of
documents in comparison to the previous interval: green classes
denote an increase in patents and red ones a decrease. A third
color is introduced when it comes to the analysis of specific
portfolios by assignees. Here, yellow rectangles signify that the
applicants had not been granted patents in that specific class. The
author also visualizes these treemaps on a timeline to better
understand the evolution of the patent landscapes [Kutz 2004].
The close coupling of query formulation and result assessment has
long been discovered in traditional information retrieval and its
effectiveness been demonstrated in systems such as the alpha
slider system by Ahlberg &amp; Shneiderman (1994). The prototype
by McLean (2000) follows exactly this idea and aims to “integrate
retrieval with interaction“. On the basis of requirements collected
from patent searchers, he built a system where users can create
“query stacks“. The users start from a broader query and then
refine it using certain filters. The results are immediately shown
on a 2-dimensional plot of results so that the consequences of
changes in the query can be quickly viewed in the plot. Each
patent is shown as a small rectangle, its position on the plot is
determined by similarity measures. Certain attributes such as the
IPC class can be colored as shown in Figure 3 [McLean 2000].
was modeled by introducing relevance feedback for individual
documents. The effects of the relevance decisions of the user were
immediately interpreted by the system and the ranking was
adapted. Here, visualization was used to increase the transparency
of the ranking algorithm. As seen on Figure 6, the changes of
positions compared to the last ranking were shown for each
document. That way the user could explore extreme changes and
find more interesting documents with potentially more relevant
terms [Hackl 2009].
The system PatViz by Koch et al. (
        <xref ref-type="bibr" rid="ref4">2009</xref>
        ) has the same goal. It also
lies its focus on the integration of insights from the analysis of
result sets into the reformulation of queries. The authors
developed ten views (e.g. a patent graph and a geo-timeline) that
show different perspectives on the current result set and that are
linked so that users can make use of brushing. A further view
called Filter Graph was developed to use different sets of results
as building blocks to produce complex extraction strategies (see
Figure 4). The different kinds of nodes allow the user to produce
subsets of the result set using filters and other operators and to
combine these in customized ways. Although this idea could be
further adapted to query formulation, its application is currently
restricted to result sets.
      </p>
      <p>Another visualization by the same authors also picks up the idea
by McLean (2000) of presenting the different query facets of a
search. Since their tool PatViz is based on work in the PatExpert
project, where different search functionalities like full text search,
metadata search, image similarity search, semantic search, and
document similarity search are provided, the authors constructed a
visual tool that allowed the user to combine these different
searches. As depicted in Figure 5, the various search types are all
presented in unique colors (Image similarity search (blue),
semantic search (grey), keyword search (green), and metadata
search (orange)), making it easy and obvious for the user to see
how a query is constructed.</p>
      <p>
        The system by Hackl (
        <xref ref-type="bibr" rid="ref4">2009</xref>
        ) also aspires to optimize the patent
search query, although by a different approach, namely relevance
feedback. The system PatentAide aims to make weighting and
advanced scoring models more transparent for patent retrieval
where Boolean matching is still most widely used. PatentAide
allows Boolean as well as probabilistic matching and ranking. The
typical information behavior of stepwise optimization of a query
The prototype by Herr et al. (
        <xref ref-type="bibr" rid="ref6 ref9">2014</xref>
        ) consists of two views that
should support the user in identifying relevant IPCs to improve
their search queries. The authors adapted tag clouds to visualize
co-occurrences between IPC classes. They compute the pair-wise
similarities of IPC subclasses based on their co-use in patents and
map these onto a 2D-plane. Two different views are available to
the user. In the first one, called map view, it is possible to gain a
general overview of all IPC subclasses used in a patent set. The
similarity between these classes is depicted by their distance and
the font size displays the overall frequency of the IPC subclass in
the set. The darts view lets users specify a class as a focus. Like
on a dartboard, co-occurring subclasses are presented on
concentric circles.
      </p>
      <p>As can be seen from the above literature, there have been some
attempts to support patent searchers during query formulation.
The users can learn from consequences on result sets or from
metadata such as IPC classes. The first idea seems very logical but
the question arises if and how the searchers can abstract from the
presentation of results to making the right decisions concerning
query reformulations. Maybe, other visualizations can support the
users in making this task easier. This forms the starting point for
the authors’ research which is described in detail in the next
section.</p>
    </sec>
    <sec id="sec-8">
      <title>5. DESIGN OF QUERY COMPARISON</title>
    </sec>
    <sec id="sec-9">
      <title>SYSTEMS</title>
      <p>Our approach is based on intensive knowledge engineering with
experts and a user centered design process with several design
iterations.</p>
      <p>Interviews with domain experts from several technical fields have
shown that for the development of complex queries for typical
patent information needs, it is crucial to compare the effects of
different queries and find the optimal query for a certain
information need [Struß et al. 2014]. The state of the art in patent
search in general also stresses the importance of iterative query
construction and query comparison.</p>
      <p>The study by Joho et al. (2010) emphasizes the importance of
search functionalities in the patent domain. The users differ very
much from the typical web searcher in that they are willing to
spend a lot of time and effort in constructing the queries and
demand a high degree of control over them. They desire a wide
variety of search possibilities and appreciate systems that take the
special requirements into account.</p>
      <p>We developed and designed two prototypes which allow the
comparison of queries from two different points of view. The
effect of changing parameters is shown to the user by different
means. The prototypes are well suited to explore and optimize
complex queries in interaction sequences.</p>
      <p>In the first case, different queries can be directly compared to
enhance the user’s understanding concerning the scope of result
sets and their overlaps or differences. The view that was
developed for this scenario is called Query Comparison. The
second suggestion is to support the patent searcher in the
development of query combinations. The view Query
Combination should inspire the user to produce effective
combinations of queries without having to undertake too many
iterations of query formulation. By giving the user an immediate
impression on result set sizes, unsuitable combinations of queries
might be prevented, thereby making the process more transparent
and efficient. Both concepts and prototypes are described in detail
below.</p>
      <p>The selected queries are then depicted as symbols in the center of
the screen. A query is represented by a circle and a combination
of queries (connected through Boolean operators) looks rather
cloud-like to visually remind the user of its formation. The bars
below contain the specified logic behind the comparisons of the
queries. They can either be formulated manually or loaded from
earlier comparisons. It is also possible to specify a group of
default comparisons that is automatically loaded when the view
opens. The result set that fulfills the Boolean logic is calculated
upon clicking the „Execute comparison“ button in the lower right
and is then represented as a circle beneath the corresponding bar.
The number of documents is shown in the circles’ center, which
provides the user with helpful information concerning the further
development of the search strategy. To see a list of the patents in a
new window, the user needs to double-click the circles. That way,
the user can immediately check if e.g. an expansion of a query led
to more relevant results. These subsequent steps of query
evaluation are especially important in patent retrieval since the
result set needs to comprise all relevant documents but must at the
same time be manageable.</p>
      <p>The second visualization, Query Combination, is shown in Figure
8. Its goal is to let the user visually explore which query
combinations might lead to manageable result sets. Patent
searchers often formulate initial subqueries that describe parts of
the search (e.g. certain materials or the use of a technology) and
combine them later on to final queries that comprise all relevant
aspects of the search. Since the first combination of queries
usually doesn’t produce the final result set, it would be
advantageous to specify a few candidates for query parts and let
the system calculate all combinations. The user can choose on the
left which query parts should be included, thereby triggering the
system to calculate all combinations. These are then depicted as
circles where the color and the size redundantly represent the
result set sizes. All document sets can be opened and assessed by
double-clicking the particular circle. It must be noted that the
calculation of all possibilities and their visual representation
should be limited to a reasonable number. The immediate and
direct visualization of the size allows the experts to easily
optimize the size of their final result set.</p>
      <p>We conducted an informal evaluation of these two prototypes
with seven professional patent searchers. The patent searchers
were recruited at the PatInfo 2014 in Ilmenau, Germany. Since
this conference is highly domain-specific, all participants were
familiar with the patent domain. The patent searchers were invited
to take part in an interview that lasted about an hour. This was
structured as follows: The experts were first asked to present their
professional experience in patent retrieval to learn something
about their background. Then, they were given an introduction
into the study and were afterwards confronted with the prototypes
and the ideas behind them. The patent searchers were allowed to
ask questions and were encouraged to give their opinion and to
suggest possible improvements.</p>
      <p>Out of the seven professionals, six experts commented favorably
on the Query Comparison view. The visualization was evaluated
as meaningful and more efficient compared to current search
facilities. One expert mentioned that the idea offered more
information than currently available in the systems; another one
highlighted its use as an analytical tool for a better understanding
of the result sets. Negative comments were the unclear use of
color, the lack of a drag and drop interaction and the question
whether such functionality would be helpful at that point of the
research process.</p>
      <p>The Query Combination view was rated positively by four
experts. They saw value in the clear overview, liked the aesthetic
design, and argued that one would not have to try out as many
queries anymore. Also, one could see when a query would
“crash”, i.e. not deliver the anticipated amount of patents. Two
professionals were not sure about the benefit; one described the
size of the result set as being a “dangerous criterion” for the
appropriateness of the result set. The meaning of the color scheme
was again criticized by one expert and the request for more
information concerning each set was also expressed once.
In summary, the evaluation of thye ideas was very encouraging
and indicated that the ideas tackle real problems of patent
searchers. The discussion with the professionals and their
suggestions will be taken into account in the further development
of the visualizations.</p>
    </sec>
    <sec id="sec-10">
      <title>6. CONCLUSION AND FUTURE</title>
    </sec>
    <sec id="sec-11">
      <title>WORK</title>
      <p>In this paper, we argued that patent retrieval and especially query
formulation is a complex process that needs to be supported by
tools. Our research aims to provide such tools on the basis of
visualizations. We presented two prototypical visualizations that
give users another perspective on query formulation and that were
evaluated with seven professional patent searchers. Since the
feedback was encouraging, the prototypes will be further
developed and integrated into a fully functional system. One of
the authors is currently working on the implementation, using
JavaScript and the JS library D3 for the visualizations.
Apart from the sub-process of query formulation, there are other
tasks during the patent retrieval process that can benefit from
visualizations. For these scenarios, visual prototypes will be
developed and further requirements of domain experts taken into
account. The final prototype that will consist of a number of
visual tools for patent searchers will be thoroughly evaluated in
formal user test settings.</p>
    </sec>
    <sec id="sec-12">
      <title>7. ACKNOWLEDGEMENTS</title>
      <p>The authors would like to thank FIZ Karlsruhe for supporting this
research through a Doctoral Fellowship to the first author.
8.
1.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Ahlberg</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Shneiderman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>1994</year>
          ):
          <article-title>Visual information seeking: tight coupling of dynamic query filters with starfield displays</article-title>
          .
          <source>In: Celebrating Interdependence. CHI'94 conference proceedings on Human Factors in Computing Systems</source>
          . Boston, New York: ACM,
          <fpage>313</fpage>
          -
          <lpage>317</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Becks</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2013</year>
          )
          <article-title>: Die Nutzung von Head-Modifier Phrasen für Patent-Retrieval. Fachinformationszentrum Karlsruhe</article-title>
          , FIZ.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bonino</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ciaramella</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Corno</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>: Review of the state-of-the-art in patent information and forthcoming evolutions in intelligent patent informatics</article-title>
          . In: World Patent Information vol.
          <volume>32</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>1</given-names>
          </string-name>
          ,
          <year>March 2010</year>
          ,
          <fpage>30</fpage>
          -
          <lpage>38</lpage>
          Chang,
          <string-name>
            <surname>R.</surname>
          </string-name>
          ; Ziemkiewicz,
          <string-name>
            <given-names>C.</given-names>
            ;
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. M.</given-names>
            , &amp;
            <surname>Ribarsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          (
          <year>2009</year>
          ):
          <article-title>Defining insight for visual analytics</article-title>
          .
          <source>Computer Graphics and Applications</source>
          , IEEE,
          <volume>29</volume>
          (
          <issue>2</issue>
          ),
          <fpage>14</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Hackl</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2009</year>
          )
          <article-title>: Transparentes Ranking und RelevanzFeedback im Patentretrieval</article-title>
          .
          <source>Fachinformationszentrum Karlsruhe</source>
          , FIZ Han,H.;
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Qiao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gui</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>: Mining Technical Topic Networks from Chinese Patents</article-title>
          .
          <source>In: Proceedings of the First International Workshop on Patent Mining and Its Applications (IPaMin</source>
          <year>2014</year>
          )
          <article-title>co-located with 7</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Konvens</surname>
          </string-name>
          <year>2014</year>
          . Hildesheim, Germany, October 6-
          <issue>7</issue>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1292</volume>
          / Jung,
          <string-name>
            <given-names>H.</given-names>
            &amp;
            <surname>Ha</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          (
          <year>2015</year>
          )
          <article-title>: InSciTe advisory: Prescriptive analytics service for enhancing research performance</article-title>
          .
          <source>In: Knowledge and Smart Technology (KST)</source>
          ,
          <source>2015 7th International Conference on Knowledge and Smart Technology. Chonburi, Thailand</source>
          .
          <fpage>28</fpage>
          -
          <issue>31</issue>
          <year>Jan</year>
          .
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          http://dx.doi.org/10.1109/KST.
          <year>2015</year>
          .7051448 Herr, D.; Han,
          <string-name>
            <given-names>Q.</given-names>
            ;
            <surname>Lohmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ;
            <surname>Brügmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            &amp;
            <surname>Ertl</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          (
          <year>2014</year>
          )
          <article-title>: Visual Exploration of Patent Collections with IPC Clouds</article-title>
          .
          <source>In: Proceedings of the First International Workshop on Patent Mining and Its Applications (IPaMin</source>
          <year>2014</year>
          )
          <article-title>colocated with Konvens 2014</article-title>
          . Hildesheim, Germany, October 6-
          <issue>7</issue>
          ,
          <year>2014</year>
          . http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1292</volume>
          / Joho, H.;
          <string-name>
            <surname>Azzopardi</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Vanderbauwhede</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>: A survey of patent users: an analysis of tasks, behavior, search functionality and system requirements</article-title>
          .
          <source>In: Proceedings of the third symposium on Information interaction in context.</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <fpage>13</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          10.
          <string-name>
            <surname>Jürgens</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Womser-Hacker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Mandl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>: Modeling the interactive patent retrieval process: an adaptation of Marchionini's information seeking model</article-title>
          .
          <source>In Proceedings of the 5th Information Interaction in Context Symposium (IIiX '14)</source>
          . New York, NY, USA: ACM,
          <fpage>247</fpage>
          -
          <lpage>250</lpage>
          . http://doi.acm.
          <source>org/10</source>
          .1145/2637002.2637034
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          11.
          <string-name>
            <surname>Jürgens</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Womser-Hacker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>: Limitations of Automatic Patent IR</article-title>
          . In: Datenbank-Spektrum.
          <source>March</source>
          <year>2014</year>
          , Volume
          <volume>14</volume>
          ,
          <issue>Issue 1</issue>
          ,
          <fpage>5</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Jeong</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Jihee</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Myaeng</surname>
            ,
            <given-names>S.-H.</given-names>
          </string-name>
          (
          <year>2009</year>
          )
          <article-title>: Automatic Discovery of Technology Trends from Patent Text</article-title>
          .
          <source>In: Proceedings of the 2009 ACM Symposium on Applied Computing. SAC. Honolulu</source>
          , Hawaii, USA, March 8-
          <issue>12</issue>
          ,
          <year>2009</year>
          . New York, NY, USA: ACM,
          <fpage>1480</fpage>
          -
          <lpage>1487</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          Available online at http://doi.acm.
          <source>org/10</source>
          .1145/1529282.1529611
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          13.
          <string-name>
            <surname>Koch</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Bosch,
          <string-name>
            <surname>H.</surname>
          </string-name>
          ; Giereth,
          <string-name>
            <given-names>M.</given-names>
            ,&amp;
            <surname>Ertl</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>2009</year>
          ):
          <article-title>Iterative integration of visual insights during patent search and analysis</article-title>
          .
          <source>In: IEEE Symposium on Visual Analytics Science and Technology, VAST</source>
          <year>2009</year>
          ,
          <volume>203</volume>
          -
          <fpage>210</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kutz</surname>
            ,
            <given-names>D. O.</given-names>
          </string-name>
          (
          <year>2004</year>
          )
          <article-title>: Examining the evolution and distribution of patent classifications</article-title>
          .
          <source>In: Proceedings of the Eighth International Conference on Information Visualisation</source>
          ,
          <string-name>
            <surname>IV</surname>
          </string-name>
          <year>2004</year>
          , IEEE,
          <fpage>983</fpage>
          -
          <lpage>988</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          15.
          <string-name>
            <surname>Lupu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mayer</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tait</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Trippe</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2011</year>
          )
          <article-title>: Current Challenges in Patent Information Retrieval</article-title>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          16.
          <string-name>
            <surname>McLean</surname>
            ,
            <given-names>A. W.</given-names>
          </string-name>
          (
          <year>2000</year>
          )
          <article-title>: Patent Space Visualization for Patent Retrieval</article-title>
          .
          <source>In: Proceedings of the ACM SIGIR 2000 Workshop on Patent Retrieval</source>
          . Athens, Greece, July
          <volume>28</volume>
          ,
          <year>2000</year>
          . http://research.nii.ac.jp/~ntcadm/sigir2000ws/
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>17. Questel: https://www.questel.com/</mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>18. STN Anavist: http://www.stninternational.de/stn_anavist.html</mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          19.
          <string-name>
            <surname>Struß</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mandl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Schwantner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Womser-Hacker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>: Understanding Trends in the Patent Domain</article-title>
          .
          <source>In: Proceedings of the First International Workshop on Patent Mining and Its Applications (IPaMin</source>
          <year>2014</year>
          )
          <article-title>co-located with Konvens 2014</article-title>
          . Hildesheim, Germany, October 6-
          <issue>7</issue>
          ,
          <year>2014</year>
          . http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1292</volume>
          /
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          20.
          <string-name>
            <surname>Widén</surname>
          </string-name>
          , G.;
          <string-name>
            <surname>Steinerová</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Voisey</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2014</year>
          ):
          <article-title>Conceptual modelling of workplace information practices: a literature review</article-title>
          .
          <source>In: Proceedings of ISIC: the information behaviour conference</source>
          ,
          <source>Leeds, 2-5 September</source>
          ,
          <year>2014</year>
          :
          <article-title>Part 1</article-title>
          . In: Information Research vol.
          <volume>19</volume>
          no.
          <issue>4</issue>
          ,
          <string-name>
            <surname>December</surname>
          </string-name>
          ,
          <year>2014</year>
          . http://www.informationr.net/ir/19-4/isic/isic08.html#.
          <source>VSOPOESqVA</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>