Application of a Novel Subject Classification Scheme for a Bibliographic Database Using a Data-Driven Correspondence

A novel subject classification scheme should often be applied to a preclassified bibliographic database for the research evaluation task. Generally, adopting a new subject classification scheme is labor intensive and time consuming, and an effective and efficient approach is necessary. Hence, we propose an approach to apply a new subject classification scheme for a subject-classified database using a data-driven correspondence between the new and present ones. In this paper, we define a subject classification model of the bibliographic database comprising a topological space. Then, we show our approach based on this model, wherein forming a compact topological space is required for a novel subject classification scheme. To form the space, a correspondence between two subject classification schemes using a research project database is utilized as data. As a case study, we applied our approach to a practical example. It is a tool used as world proprietary benchmarking for research evaluation based on a citation database. We tried to add a novel subject classification of a research project database.

Introduction

Subject classification is a popular and useful aspect for academic database and data analysis. Academic resources, such as research articles, journals, conference proceedings, books, field samples, software, and various electronic materials, are organized by subject classifications in the general or domain-specific approach. University libraries, institutional resource centers, and research labs organize their research resources in an efficient manner to gain easy access to these resources when necessary. Research funding agencies manage their applicants, projects, and reports by classifying research subjects, which are often diversified and transformed to reflect on the current research landscape. Academic fields are fundamental concepts of academic classifications for organizing academic materials. From analysis perspectives, institutional research (IR) focuses on research and educational activities, in which the research and educational portfolios of researchers, professors, and staff are analyzed through subject classifications. Moreover, the databases of national grants are often surveyed via subject classifications.

Practically, classification has been utilized in library catalogs for not less than a 100 years (Hjørland, 2008). The Dewey Decimal Classification is an old library classification invented in 1876 and is popular for classifying books in the shelves of university libraries. Other popular library classifications, such as the Universal Decimal Classification, the Library of Congress Classification, and the Colon Classification, were also invented a 100 years ago. They were revised several times to fit with the current book subject diversity. Japanese library classification examples include the Nippon Decimal Classification and the Japan National Diet Library Classification, which were released in 1928 and 1963, respectively. For academic journals, the Web of Science (WoS) subject classification is one of the most popular subject classifications for the WoS citation database. For research evaluation purposes, journals are frequently being classified based on specific viewpoints. The Essential Science Indicator (ESI) is one of the specifically developed subject classifications for research evaluation based on the WoS citation database.

In the research evaluation domain, special subject classifications that are developed for research and educational work should be adopted throughout all kinds of target databases (Gómez et al., 1996). National research and educational evaluation organizations use their original subject classifications to classify organizations and persons suitable for domestic evaluation tasks. Then, they compare them globally based on research and educational output records collected from world common output databases such as the WoS citation database. For example, the UK government defines Units of Assessment as subject classifications for the Research Assessment Exercise and the Research Excellence Framework. The Italian evaluation agency for university and research systems ANVUR (Agenzia Nazionale di Valutazione del Sistema Universitario e della Ricerca) constructed an original category scheme to be used for its evaluations. Excellence in Research for Australia, which is an Australian research evaluation program, developed the original subject classification scheme: Fields of Research. All these subject classifications must be adopted for the WoS citation database to analyze their national activities and compare them with regard to their common standards. Along with current international business qualifications on research evaluation, the same requirements emerged from the universities in Japan to ensure that the Japanese national funding programs KAKENHI subject classifications would be adopted for the WoS citation database.

However, adopting subject classifications for bibliographic databases is a highly challenging task. For example, in 2019, the WoS citation database in InCites™, which is a research output evaluation tool, comprised 58,395,008 article records of 24,688 journals. Even assigning subject categories for articles or journals as a set of units is labor intensive and time consuming. Hence, an excellent, effective, and efficient method for assigning their subject categories is necessary. In this study, we propose an approach to applying a novel subject classification scheme for the WoS citation database.

Our main contributions of the work are as follows:

• We propose an approach to apply a novel subject classification scheme for a subject-classified database using a data-driven correspondence between the new and present ones, which is accustomed to digital libraries.

• We give a fundamental analytical model of subject classification scheme based on set theory and describe compact topological space formation for a new subject classification scheme as a necessary condition.

• We demonstrate the effectiveness and efficiency of our approach to a practical bibliographic database.

In the following sections, firstly we look around the related work to state our approach in section Related Work, then describe our approach in the section Data-Driven Approach to Applying a Novel Subject Classification Scheme, and successively demonstrate the effectiveness and efficiency of our approach in a case study in section Case Study. Finally, we conclude our approach in the section Conclusions and Future Work.

Related Work

In the above introductory section, we mentioned an issue around subject classifications from the viewpoint of library and information science and scientometrics. To tackle this issue, a series of related work in the computer science such as information retrieval, data mining, and digital libraries have been investigated for several decades. As for the general problem setting, subject classification of research items on bibliographic database refers to a part of automated text categorization problems. It goes back to Maron's (1961) seminal work on a probabilistic text classification. The methods are mainly divided into two types, i.e., supervised learning and unsupervised learning, which are also named as classification and clustering. The former requires the labeled data indicating the right answer to a given decision problem so as to derive classifiers. The classifiers then are applied to the target data to be classified. The example methods are naïve bays classification, neural networks, support vector machines. The latter does not need such the labeled data and extracts intrinsically the classification pattern from data and classify them. The example methods are k-means, expectation maximization (EM), hierarchical agglomerative clustering, divisive clustering, matrix decompositions, e.g., latent semantic indexing (LSI) and principal component analysis (PCA), and topic modeling, e.g., latent Dirichlet allocation (LDA). Sebastiani (Sebastiani, 2002) thoroughly surveyed these classifier techniques from the computer science perspective, and Jain et al. (1999) also surveyed clustering techniques for computer vision. Both classification and clustering are so general that they are frequently organized and explained from different basic contexts, such as pattern recognition (Bishop, 2006), information retrieval (Manning et al., 2008) and data mining (Han et al., 2011).

When adapting a method to the predefined classification scheme, classification is better utilized than clustering. Classification learns a decision from a labeled data, in contrast, clustering learns implicit relationships of unlabeled data. In relation to our problem setting, multi-label classification or multi-label learning have been investigated on several basic machine learning architectures. Multi-label classification classifies target data under 2^|L| classification space where L is a set of labels. Recent examples are multi-label learning based on SVM (Chang et al., 2017), based on deep learning (Mai et al., 2018), and based on ensemble classification (Büyükçakir et al., 2018). For very large classification space, extreme multi-label classification is proposed, e.g., a method based on graph embedding (Tagami, 2017), a method based on convolutional neural network (CNN) (Liu et al., 2017), and a method based on attention model of neural networks (Wang et al., 2018). Moreover, label hierarchy also can be considered so that part-of, is-a, and inclusion relationships are extracted from external data sources such as Wikipedia in the classification task (Bairi et al., 2016; Xie et al., 2017).

In digital libraries, the mappings between different classification schemes have been considered for a long period. For example, the method of automatically converting from existing classifications of documents into another scheme used in a quality-controlled database is occasionally used in co-operative cataloging projects and union catalogs, sometimes even in individual OPACs as soon as cataloging records using a different classification scheme are imported or exchanged (Koch et al., 1997). These mappings for the purpose of information integration and exchange was widely discussed in the 1970s, and is even more relevant today with the overall trend of information integration on the web (Slavic, 2011).

Data-Driven Approach to Applying a Novel Subject Classification Scheme

Our approach is accustomed to digital libraries. We assume that a subject classification scheme has been originally adopted for a bibliographic database such as the WoS citation database. Then, we attempt to apply a new subject classification scheme for this database based on the relationship between two subject classification schemes. The relationship is the correspondence between them, which is induced by data.

Subject Classification Model of the Bibliographic Database

First, we defined the subject classification model of the bibliographic database such as the WoS citation database to explain our approach. This model is a mathematical formula and a psychological aspect of subject categories embedded in the database.

Then, we assumed that a bibliographic database representing a set of articles for scientific research is available. Each article is labeled with at least one category of the subject classification scheme. That is, all articles are classified on the basis of the subject classification scheme. This scheme implies compact topological space in the database. It states the database structure that affects the analysis by using the subject classification scheme.

Definition 1 (database with a subject classification scheme). A database S is a set of articles a_n, and a subject classification scheme C is a set of subject categories c_λ. Articles attributed to a subject category comprise a subset of S; hence, subject categories in a subject classification scheme refer to a family of subsets (O_λ)_λ∈Λ of S. O is an open set, whereas Λ is an index set. A subset O_λ depends on the corresponding subject category c_λ. Therefore, we define a map f from the subject classification scheme C to the powerset 𝔓(S).

Theorem 1 (finite cover). A practical subject classification scheme C is mapped to a finite cover 𝔒 of S.

Proof. In practical bibliographic databases, a subject classification scheme C consists of finite elements c_λ that are mapped to finite subsets O_λ using a map f. Let 𝔒 be a subset of 𝔓(S) comprising {O_i|i ∈ I}, where I is a finite index set. Hence, S = ⋃_i∈I O_i (O_i∈ 𝔒), where 𝔒 is referred to as a finite cover of S.

Theorem 2 (compact topological space). A practical subject classification scheme C implies a compact topological space $(S,\widetilde{𝔒})$.

Proof. In practical bibliographic databases, a subject classification scheme C consists of finite elements c_i that are mapped to finite subsets O_i using a map f. Let 𝔒 be a subset of 𝔓(S) comprising {O_i|i ∈ I}, where I is a finite index set. For reference, let 𝔒₀ be the subset of 𝔓(S) that consists of {∩_i∈IA_i|A_i∈ 𝔒}, where the element is S if I = ∅. Let $\widetilde{𝔒}$ be a subset of 𝔓(S) comprising {∪_λ∈ΛB_λ|B_λ ∈ 𝔒₀}, where the element is ∅ if Λ = ∅. Here Λ is a finite or infinite index set. Thus, $\widetilde{𝔒}\supset 𝔒$, $S\in \widetilde{𝔒}$, and $\varnothing \in \widetilde{𝔒}$, where $\widetilde{𝔒}$ is satisfied as a topology using the necessary and sufficient conditions. Theorem 1 also indicates a compact topological space $(S,\widetilde{𝔒})$. When a finite cover exists in a topological space, we refer to it as a compact topological space.

Compact Topological Space Formation for a New Subject Classification Scheme

According to the subject classification model of the bibliographic database, we propose an approach of applying a new subject classification scheme for the database.

Here, we assume the following condition. A subject classification scheme C⁽¹⁾ containing subject categories $c_i^{(1)}$ is mapped to a finite cover ${𝔒}^{(1)}=\left\{O_i^{(1)}|i\in I^{(1)}\right\}$ using a map f₁, indicating a compact topological space $(S,{\widetilde{𝔒}}^{(1)})$.

Conventionally, we can use an approach to directly assign subject categories for the database records. We assign subject categories $c_i^{(2)}$ of a new classification scheme C⁽²⁾ to each article of S. Thus, a map f₂ from C⁽²⁾ to a finite cover ${𝔒}^{(2)}=\left\{O_i^{(2)}|i\in I^{(2)}\right\}$ is constructed, implying a compact topological space $(S,{\widetilde{𝔒}}^{(2)})$.

In our approach, we develop a correspondence Γ : C⁽²⁾ → C⁽¹⁾(Γ = (C⁽²⁾, C⁽¹⁾; G), G⊂C⁽²⁾×C⁽¹⁾), where $c_i^{(2)}\in C^{(2)},c_j^{(1)}$ $\in C^{(1)},c_i^{(2)}\times c_j^{(1)}\in G,C^{(2)}={\bigcup }_i\left\{c_i^{(2)}\right\}$, and $C^{(1)}={\bigcup }_j\left\{c_j^{(1)}\right\}$, to guarantee the existence of a finite cover.

Then, we construct a map

$\begin{array}{l}{g}_1:C^{(2)}\to {\overline{ℭ}}^{(1)}\\ =\left\{{\overline{C}}_i^{(1)}|\begin{array}{c}{c}_i^{(2)}\in C^{(2)},c_j^{(1)}\in C^{(1)},c_i^{(2)}\times c_j^{(1)}\in G,\\ i\in I^{(2)},{\overline{C}}_i^{(1)}={\displaystyle {\bigcup }_{j\in I_i^{(1)}}}\left\{c_j^{(1)}\right\}\end{array}\right\},\end{array}$

where $S={\bigcup }_{i\in I^{(2)}}{\overline{C}}_i^{(1)},$ to be a finite cover. Finally, we establish a map

$\begin{array}{l}{g}_2:{\overline{ℭ}}^{(1)}\to {\overline{𝔒}}^{(1)}\\ =\left\{{\overline{O}}_i^{(1)}|\begin{array}{c}{\overline{C}}_i^{(1)}\in {\overline{ℭ}}^{(1)},c_j^{(1)}\in {\overline{C}}_i^{(1)},O_j^{(1)}=f_1\left(c_j^{(1)}\right),\\ {\overline{O}}_i^{(1)}={\displaystyle {\bigcup }_{j\in I_i^{(1)}}}{O}_j^{(1)}\end{array}\right\},\end{array}$

where $S={\bigcup }_{i\in I^{(2)}}{\overline{O}}_i^{(1)},$ to be a finite cover. Hence, we obtain a composite map g₂ ◦ g₁ from C⁽²⁾ to a finite cover ${\overline{𝔒}}^{(1)}$, indicating a compact topological space $\left(S,{\widetilde{\overline{𝔒}}}^{(1)}\right)$. Evidently, ${\widetilde{\overline{𝔒}}}^{(1)}\subset {\widetilde{𝔒}}^{(1)}$.

Inducing a Correspondence Between Two Subject Classification Schemes Using a Research Project Database

To determine the correspondence between two subject classification schemes, experts of the subject classification schemes normally discuss the relationship structure of these schemes based on their knowledge and practical experiences.

In our approach, the actors are data scientists who analyze a database wherein an entity is categorized into two subject classification schemes and then induce the correspondence between them through an analysis.

As evidence data, anything that includes information of the relationship between the two subject classification schemes is useful. One of the available resources is a research project database that is rather popular among academic databases. In our case, it is the research project database KAKEN that includes the structural relationship between the WoS and KAKENHI subject categories. Thus, we ensure that our approach can adopt the research project database.

Using a Research Project Database

We define a research project database such as the KAKEN database as follows. A research project database T describes research projects b_n, one of whose outputs is a list of research articles a_n on a bibliographic database S.

The research articles a_n of S are categorized with a subject classification scheme C⁽¹⁾. We define the map f₁ by which C⁽¹⁾ is mapped to a finite cover ${𝔒}_S^{(1)}=\left\{O_i^{(1)}|i\in I^{(1)}\right\}$ of S, implying a compact topological space $\left(S,{\widetilde{{𝔒}_S}}^{(1)}\right)$.

The research projects b_n of T are categorized with a subject classification scheme C⁽²⁾. We define a map h₁ by which C⁽²⁾ is mapped to a finite cover ${𝔒}_T^{(2)}=\left\{O_i^{(2)}|i\in I^{(2)}\right\}$ of T, implying a compact topological space $\left(T,{\widetilde{{𝔒}_T}}^{(2)}\right)$.

We define a map h₂:T → 𝔓(S) to ensure that a research project produces a set of research articles. Here, let the image of the map be reduced to 𝔖 (⊂𝔓(S)) to become a surjection. Then, we also define a map $h_2\prime :T\to \mathfrak{P}\left(S\prime \right)$, where $S^{\prime }={\bigcup }_{i\in I_{𝔖}}{O}_i(O_i\in 𝔖)$ and S′ ⊂ S. For the image S′, we define a map f₁′ by which C⁽¹⁾ is mapped to a finite cover ${\mathfrak{O}}_{S\prime }^{\left(1\right)}=\left\{O_i^{\prime \left(1\right)}|i\in I^{\left(1\right)}\right\}$ of S′, implying a compact topological space $\left(S\prime ,{\widetilde{{\mathfrak{O}}_{S\prime }}}^{\left(1\right)}\right)$.

Next, we develop a map

$\begin{array}{l}{h}_3:{\mathfrak{O}}_T^{(2)}\to {\mathfrak{O}}_{S\prime }^{(2)}\\ =\left\{{\overline{O}}_{S\prime }^{(2)}\right|\begin{array}{c}\begin{array}{c}{O}_{Ti}^{(2)}\in {\mathfrak{O}}_T^{(2)},b_j^{(2)}\in O_{Ti}^{(2)},O_{S\prime j}^{(2)}=h_2\prime \left(b_j^{(2)}\right),\\ {\overline{O}}_{S\prime i}^{(2)}={{\displaystyle \cup }}_j{O}_{S\prime j}^{(2)},\end{array}\end{array}\}\end{array}$

which is a subset of 𝔓(S′), where ${𝔒}_{S^{\prime }}^{(2)}$ is a finite cover. Subsequently, we obtain a composite map $h_3◦h_1:C^{(2)}\to {𝔒}_{S^{\prime }}^{(2)}$. Considering that ${𝔒}_{S^{\prime }}^{(2)}$ is a finite cover, it induces a compact topological space.

In this case, we validated the following robust suppositions. The composite map $h_3◦h_1:C^{(2)}\to {𝔒}_{S^{\prime }}^{(2)}$ represents the classification of articles using the subject classification scheme. Moreover, if two images on S′ of maps f₁′ and h₃ ◦ h₁ are equivalent, then their inverse images also have the same relation.

Natural Overlapping Between Two Subject Classification Schemes

Here, we obtained actual data on the relationship between two subject classification schemes on a database. We have a database S′ and two sets of finite covers ${𝔒}_{S^{\prime }}^{(1)}$ and ${𝔒}_{S^{\prime }}^{(2)}$ that are images from C⁽¹⁾ and C⁽²⁾.

In natural phenomena, we often observe statistical laws of nature. A popular law in the linguistic field, that is, Zipf's law, states that the frequency of words follows a distribution where the word rank n has a frequency proportional to 1/n. Generally, the same distribution is observed in natural phenomena, referred to as a power law, which is denoted by ln p(x) = −α ln x + c, where α and c are constants (Newman, 2005). For example, all the following obey power law distributions: the sizes of city populations, earthquakes, moon craters, solar flares, computer files, and wars; the occurrence frequency of personal names in most cultures; the number of papers written by scientists; the number of citations received by papers; the number of hits on web pages; and the sales of books, music recordings, and almost every other branded commodity.

When actual data are analyzed, the power law trend in most cases holds only for an intermediate range of values; a power law breakdown exists in the distribution tails (Martínez-Mekler et al., 2009). The reason for this is finite size effects (e.g., insufficient data for good statistics), network dilution, network growth constraints, and different underlying dynamical regimes. Thus, power law corrections (sometimes referred to as scaling corrections) occur in the form of exponential, Gaussian, stretched exponential, gamma, and various types of extreme value distributions. This phenomenon obeys a discrete version of a generalized beta distribution, which is given by f(r) = (A(N + 1 − r)^b)/r^a. Here, r is the rank, N is its maximum value, A denotes the normalization constant, and (a, b) are two fitting exponents.

In our case, the elements of finite covers ${𝔒}_{S^{\prime }}^{(1)}$ and ${𝔒}_{S^{\prime }}^{(2)}$ represent natural overlapping sets. For $O^{\left(2\right)}(\in {\mathfrak{O}}_{S^{\prime }}^{\left(2\right)})$), its intersections O⁽²⁾ ∩ O⁽¹⁾ to all $O^{\left(1\right)}(\in {\mathfrak{O}}_{S^{\prime }}^{\left(1\right)})$) are present. Its cardinalities greater than zero, if sorted in rank order, obey the discrete version of the generalized beta distribution given that the subject categories are finite.

Metrics for Inducing a Correspondence

To identify a correspondence between C⁽¹⁾ and C⁽²⁾, we attempt to find a subset $\left\{O_i^{(1)}|i\in I_j^{(1)}\right\}$ of ${\mathfrak{O}}_{S\prime }^{\left(1\right)}$ for $O_{j\in I^{(2)}}^{(2)}$ to be ideally satisfied that $O_j^{(2)}={\bigcup }_{i\in I_j^{(1)}}{O}_i^{(1)}.$ However, in most cases, $O_j^{(2)}\not\supset O_i^{(1)}$ and $O_j^{(2)}\ne {\bigcup O}_i^{(1)}$. Hence, we first define the following metrics: (precision)

$\begin{array}{l}{d}_{pj}=\frac{\left|{\displaystyle {\bigcup }_{i\in I_j^{(1)}}}\left(O_j^{(2)}\cap O_i^{(1)}\right)\right|}{\left|{\displaystyle {\bigcup }_{i\in I_j^{(1)}}}{O}_i^{(1)}\right|}\end{array}$

and (recall)

$\begin{array}{l}{d}_{rj}=\frac{\left|{\displaystyle {\bigcup }_{i\in I_j^{(1)}}}\left(O_j^{(2)}\cap O_i^{(1)}\right)\right|}{\left|O_j^{(2)}\right|}.\end{array}$

Then, we define the generalized harmonic mean of precision and recall: (F_β-measure)

$\begin{array}{l}{d}_{fj}=\frac{\left(1+{\beta }^2\right)d_{pj}{d}_{rj}}{{\beta }^2{d}_{pj}+d_{rj}},\beta >0.\end{array}$

Finally, we use the F_β-measure to determine which element has a correspondence relation. The basic strategy is to choose the subset $\left\{O_i^{(1)}|i\in I_j^{(1)}\right\}$ which maximize the F_β-measure. β affects the weight balance between d_pj and d_rj for d_fj. β = 1 indicates the equivalent balance between them. We can use the β to control the balance in relation to the existence of a finite cover.

In practical cases, we might project the cardinal number of the subsets onto the contingency table between two subject classification schemes. A contingency table, or a two-way frequency table, is a tabular mechanism with rows and columns used in statistics to present categorical data in terms of frequency counts.

By using the contingency table that represents the overall counting of elements, we calculate the following pseudo precision, recall, and F_β-measure based on the original definitions:(pseudo precision)

$\begin{array}{l}{d}_{pj}^{\prime }=\frac{{\displaystyle {\sum }_i}|O_j^{(2)}\cap O_i^{(1)}|}{{\displaystyle {\sum }_i}\left|O_i^{(1)}\right|}\end{array}$

and (pseudo recall)

$\begin{array}{l}{d}_{rj}^{\prime }=\frac{{\displaystyle {\sum }_i}|O_j^{(2)}\cap O_i^{(1)}|}{\left|O_j^{(2)}\right|}.\end{array}$

Then, the generalized harmonic mean of precision and recall is also calculated: (pseudo F_β-measure)

$\begin{array}{l}{d}_{fj}^{\prime }=\frac{(1+{\beta }^2)d_{pj}^{\prime }{d}_{rj}^{\prime }}{{\beta }^2{d}_{pj}^{\prime }+d_{rj}^{\prime }},\beta >0.\end{array}$

The values of precision and pseudo precision, the values of recall and pseudo recall, and the values of F_β-measure and pseudo F_β-measure can be different because of subadditivity.

The Main Steps to Work on Our Approach

To follow the methodology above, the main steps of the work can be illustrated in Figure 1. The first step is to induce a correspondence between two subject classification schemes by using F_β-measure (step 1 in the figure). In practical cases, alternatively, the first step is to construct a contingency table between two subject classification schemes (step 1'-1) and then induce a correspondence between them by using pseudo F_β-measure (step 1'-2). The second step is to revise the correspondence to guarantee the existence of a finite cover of the novel subject classification scheme (step 2).

FIGURE 1

Figure 1. The main steps to work on our methodology: constructing a contingency table, inducing a correspondence, and revising the correspondence.

Case Study

To verify our approach described previously, we adapt it for a practical case. A world-leading research output evaluation tool, that is, InCites™, which is produced by Clarivate Analytics, Co., Ltd., provides bibliometric analysis functions, wherein bibliometrics can be analyzed using domestic, WoS, and ESI subject classification schemes. Japanese users are eager to utilize the subject classification scheme of Japan's largest national research grants KAKENHI to analyze their IR outputs on the system. The WoS citation database comprises bibliographic records originally classified using the WoS subject classification scheme. The KAKENHI subject classification scheme is a novel subject classification scheme to be applied in the WoS citation database. We were occasionally given an opportunity to deal with this challenging task.

Inducing a Correspondence Between the WoS and KAKENHI Subject Categories

We use the following steps to induce a correspondence between the WoS and KAKENHI subject categories.

Developing a Contingency Table as Evidence Data

We construct a contingency table between the WoS and KAKENHI subject categories to induce a correspondence.

The research project database KAKEN represents the archival records of research projects and the outputs of KAKENHI grants in Japan. The KAKEN database contains the descriptions of projects started after 1964 and the lists of their outputs, including journal articles, conference proceedings, reports, and books. The research projects are classified using the KAKENHI subject classification scheme that has been defined for the corresponding year.

In this study, we select the research projects in 2009 whose KAKENHI subject classification scheme consists of a hierarchical structure: four categories, 10 areas, 67 disciplines, and 284 research fields. The total number of projects is 58,952, and that of output publications that might be written in English is 173,940.

The English articles in the KAKEN database are listed in a citation format, and it is not yet clear to which WoS categories they are assigned. Hence, we identified the same bibliographic records in the WoS citation database as of 2009 and 2010 (99.8% of output publications are published in the years) through a set of record linkage techniques to obtain a set of articles S′ that are classified using both the KAKENHI and WoS classification schemes, as depicted in Figure 2 (Kurakawa et al., 2014). The size of the adopted WoS citation database was 3,925,776, which is classified with 251 subject categories of the WoS classification scheme and 22 subject categories of the ESI classification scheme.

FIGURE 2

Figure 2. Bibliographic linkage between the KAKEN and WoS citation databases in a Venn diagram.

Consequently, we obtained a total of 75,042 pairs of citations, which is 43.1% of the 173,940 articles listed in the KAKEN database. The record linkage technique uses i-Linkage (Aizawa and Oyama, 2005) as a ranking function and SVM as a classification function to identify the same bibliographic records in the KAKEN database and the WoS citation database. In a 10-fold cross validation of 800 samples, the accuracy of the linkage was 0.9501. The precision, recall, and f-measure were 0.9492, 0.9510, and 0.9498, respectively.

We next constructed a contingency table for the two subject classification schemes based on this linkage result, as illustrated in Figure 3. An example in Figure 4 shows part of the contingency table between the third-level 67 KAKENHI and 251 WoS subject categories.

FIGURE 3

Figure 3. Contingency table for the KAKENHI and WoS subject categories.

FIGURE 4

Figure 4. Example screen of Excel showing part of the contingency table between the third-level subject categories of the KAKENHI and WoS subject classification schemes.

Among the 75,042 pairs of citations, those categorized with both the subject classification schemes were reduced to 59,595 pairs because the 52,956 out of the total 58,952 research projects are assigned with the KAKENHI subject classification scheme and the others are not.

When the overall counting of the citations to each subject category was applied, we obtained the sum of 97,175 frequency counts in the contingency table. In the WoS citation database, each article is assigned one or more subject categories of the WoS classification scheme, and is simultaneously assigned one subject category of the ESI classification scheme. When we count a citation assigned to multiple subject categories, the frequency count is increased by one for each corresponding subject category. In the KAKEN database, each article is assigned one subject category of the KAKENHI classification scheme, the frequency count is increased by one for the corresponding subject category. Thus, for a citation, the frequency counts in the contingency table are increased by the number of WoS categories or ESI categories, and it looks like many articles were published under the corresponding KAKENHI category.

Analysis of the Contingency Table

To clearly show what happens in the contingency table, we compared the distribution among the WoS subject categories with that of the KAKENHI subject category. We observed a good fit of the discrete generalized beta distribution to the rank-ordering distribution in the contingency table.

Figures 5, 6 show the rank-ordering distributions for the first and second levels of the subject categories of the KAKENHI subject classification scheme. The first-level subject categories include “Integrated Science and Innovative Science” (l1-01), “Humanities and Social Sciences” (l1-02), “Science and Engineering” (l1-03), and “Biological Sciences” (l1-04). The second-level subject categories include “Comprehensive Fields” (l2-01), “New Multidisciplinary Fields” (l2-02), “Humanities” (l2-03), “Social Sciences” (l2-04), “Mathematical and Physical Sciences” (l2-05), “Chemistry” (l2-06), “Engineering” (l2-07), “Biology” (l2-08), “Agricultural Sciences” (l2-09), and “Medicine, Dentistry, and Pharmacy” (l2-10). For each KAKENHI subject category at any level, the frequencies corresponding to the 251 WoS subject categories are sorted in rank order. If the frequency is zero, then the WoS subject category is omitted in the distribution. The x axis of the graph represents the rank, and the y axis of the graph denotes the log scale of the frequency count. With these scales, the discrete generalized beta distribution is fitted to the data to ensure that R-squared as a goodness-of-fit statistical score ranges from 0.986 to 0.994 for the first level and from 0.970 to 0.994 for the second level. In this case, the sets of parameters a and b that affect the figures of the distribution vary.

FIGURE 5

Figure 5. Rank-ordering distributions for the first-level subject categories of the KAKENHI subject classification scheme.

FIGURE 6

Figure 6. Rank-ordering distributions for the second-level subject categories of the KAKENHI subject classification scheme.

The distributions in the graph can be categorized into two types: concentration and dispersal. In the first level of the KAKENHI subject categories, the concentration type refers to the graph of “Science and Engineering” (l1-03) and “Biological Sciences” (l1-04). The dispersal type refers to the graph of “Integrated Science and Innovative Science” (l1-01). In the second level, the concentration type refers to the graph of “Humanities” (l2-03), “Chemistry” (l2-06), and “Mathematical and Physical Sciences” (l2-05). The dispersal type refers to the graph of “Comprehensive Fields” (l2-01) and “New Multidisciplinary Fields” (l2-02). The concentration type means the subject category is a specialized field. The dispersal type means the subject category is a multidisciplinary field.

For all the distributions, the goodness of fit to the discrete generalized beta distribution implies that a set of articles categorized to the KAKENHI subject category naturally overlaps that of articles categorized to the WoS subject categories at any level. However, the overlapping degree depends on the target subject categories.

Maximizing the F-Measure

Here, we analyzed the possibility that each KAKENHI subject category overlaps with the WoS subject categories. The aim of inducing a correspondence between the KAKENHI and WoS subject categories encouraged us to calculate the F_β-measures between these subject categories.

Table 1 lists the maximum pseudo F₁-measure, and the corresponding precision, and recall to produce the maximum pseudo F₁-measure, the number of WoS subject categories to get the maximum pseudo F₁-measure, and the cardinality for the third-level 67 disciplines of the KAKENHI subject classification scheme. The order of the disciplines in the list is the same as that of the KAKENHI subject classification scheme. The disciplines which are under the same area are listed together as a group. Each 67 discipline is included in either of 10 areas. For example, “Informatics” (l3-01), “Brain Sciences” (l3-02), “Laboratory Animal Science” (l3-03), “Human Informatics” (l3-04), “Health/Sports Science” (l3-05), “Human Life Science” (l3-06), “Science Education/Educational Technology” (l3-07), “Sociology/History of Science and Technology” (l3-08), “Cultural Assets Study” (l3-09), “Geography” (l3-10) are under the same area “Comprehensive Fields” (l2-01). In the same way, “Environmental Science” (l3-11) to “Gender” (l3-18) are under “New Multidisciplinary Fields” (l2-02), “Philosophy” (l3-19) to “Cultural Anthropology” (l3-25) are under “Humanities” (l2-03), “Law” (l3-26) to “Education” (l3-32) are under “Social Sciences” (l2-04), “Mathematics” (l3-33) to “Plasma Science” (l3-37) are under “Mathematical and Physical Sciences” (l2-05), “Basic Chemistry” (l3-38) to “Materials Chemistry” (l3-40) are under “Chemistry” (l2-06), “Applied Physics” (l3-41) to “Integrated Engineering” (l3-48) are under “Engineering” (l2-07), “Basic Biology” (l3-49) to “Anthropology” (l3-51) are under “Biology” (l2-08), “Plant Production and Environmental Agriculture” (l3-52) to “Boundary Agriculture” (l3-59) are under “Agricultural Sciences” (l2-09), “Pharmacy” (l3-60) to “Nursing” (l3-67) are under “Medicine, Dentistry, and Pharmacy” (l2-10).

TABLE 1

Table 1. Maximum pseudo F₁-measure for the third-level 67 disciplines of the KAKENHI subject categories against the 251 WoS subject categories.

Here, the top three subject categories which have greater maximum F₁-measure were “Mathematics” (l3-33), “Literature” (l3-21), and “Economics” (l3-28), whose pseudo average precision, recall, and maximum F₁-measure were (0.734, 0.792, 0.762), (0.700, 0.683, 0.691), and (0.692, 0.622, 0.655), respectively. The number of WoS subject categories to get the maximum pseudo F₁-measures were 4, 10, and 12, respectively. This means the corresponding WoS subject categories are much more relevant to the KAKENHI subject category. On the other hand, the bottom three subject categories which have less maximum F₁-measure were “Cultural Assets Study” (l3-09), “Laboratory Animal Science” (l3-03), and “Genome Science” (l3-14), whose pseudo average precision, recall, and maximum F₁-measure were (0.200, 0.036, 0.062), (0.059, 0.074, 0.066), and (0.040, 0.203, 0.067), respectively. The number of WoS subject categories to get the maximum pseudo F₁-measures were 1, 1, and 3, respectively. This means the corresponding WoS subject categories are less relevant to the KAKENHI subject category. The overall pseudo average precision, recall, and maximum F₁-measure were 0.315, 0.367, and 0.317, respectively. The number of WoS subject categories to get the maximum pseudo F₁-measures ranged from 1 to 24 whose average is 6.1, which is rather small when compared with the maximum number 251. The cardinality of the KAKENHI subject categories ranged from 9 to 10,215 whose average is 1,450.4. The larger the cardinality is, the more reliable the measure is, because of law of large numbers.

Miscellaneous Considerations

Apart from the quantitative analysis mentioned previously, we set the threshold in the contingency table to ignore the relations between the 251 WoS subject categories and the 67 disciplines of the KAKENHI subject categories. Here, for every WoS subject category $O_i^{(1)}$, the number of relations with the KAKENHI subject categories $O_j^{(2)}$ is only at a maximum of 1–4. Moreover, when the recall rate for $O_i^{(1)}$ exceeds 0.5, we discontinued adding any relation.

We next verified all the correspondence between $O_i^{(1)}$ and $O_j^{(2)}$ by means of subject category keywords, specifically for subject categories with few evidence data. The cases are “Arts and Humanities,” “Music,” and “Religion,” among others of the $O_i^{(1)}$. This manual relation finding guarantees the existence of a finite cover by $O_j^{(2)}$.

Finally, we induced a correspondence between the 10 areas and 67 disciplines of the KAKENHI subject classification scheme and the 251 WoS subject categories, which are released in public¹. A total of 324 relations are available in between the 10 areas of the KAKENHI subject classification scheme and the WoS subject categories, and 409 relations are present in between the 67 disciplines of the KAKENHI subject classification scheme and the WoS subject categories.

Classification Results on the WoS Citation Database

With the correspondence, InCites™ preprocesses its internal database and provides the analysis functionality by using the KAKENHI subject classification scheme. The techniques used by the tool in providing the analysis function, its quantitative statistics, and user feedbacks of the function are discussed in the following sections.

KAKENHI Subject Categories of InCites™

InCites™ provides an analytical workbench on the WoS citation database. It preprocesses the database to demonstrate users' target entities such as people, organizations, regions, research areas, journals, books, conference proceedings, and funding agencies. Figure 7 shows an example screen presenting the article counts of Japanese authors based on the 67 disciplines of the KAKENHI subject classification scheme. The bubbles in the figure represent the top 25 proportional numbers of articles, each of which corresponds to the KAKENHI subject category. The total number of articles by the Japanese authors is 3,192,449 of the overall 58,395,008 articles published from 1980 to 2018. Among this Japanese authorship, the top or first KAKENHI subject category at the discipline level is “Clinical internal medicine,” with a total number of 1,096,040. The second and third are “Basic medicine” and “Applied chemistry,” with a total number of 617,970 and 526,139, respectively.

FIGURE 7

Figure 7. Example screen of InCites™, with the bubbles representing proportional numbers of articles classified using the KAKENHI subject categories.

Article Counts Using the WoS and KAKENHI Subject Categories

For Japanese authors' articles, we compared the distributions using the subject classification schemes. We illustrated the proportions based on the statistics provided by the tool through the subject classification schemes shown in Figures 8–10.

FIGURE 8

Figure 8. Top 30 subject distribution of Japanese authors' articles by using the WoS subject classification scheme.

Figure 8 shows the top 30 subject distribution of articles using the WoS subject classification scheme. At the top of the list are “Engineering, Electrical & Electronic,” “Physics, Applied,” “Biochemistry & Molecular Biology,” “Materials Science, Multidisciplinary,” and “Chemistry, Multidisciplinary,” among others. The distribution of the graph gradually declines similar to an inverse proportional graph.

Figure 9 shows the subject distribution of the same set of articles with the 10 areas level of the KAKENHI subject classification scheme. At the top of the list are “Medical/Dental/Pharmaceutical,” “Engineering,” “Math/Physics,” “Multidisciplinary,” and “Chemistry,” among others. The number of articles for the subject categories declines linearly rather than inversely. Figure 10 shows the top 30 subject distribution of articles by the 67 disciplines level of the KAKENHI subject classification scheme. At the top of the list are “Clinical Internal Medicine,” “Basic Medicine,” “Applied Chemistry,” “Clinical Surgery,” and “Electrical and Electric Engineering,” among others. The number of articles declines inversely. Unlike the original WoS subject categories, this statistical result provides a different impression that life sciences are the strongest among the others. However, the WoS subject classification scheme generates an impression that “Electrical/Electronic Engineering” and “Physics” are the strongest among the others.

FIGURE 9

Figure 9. Entire subject distribution of Japanese authors' articles with the 10 areas level of the KAKENHI subject classification scheme.

FIGURE 10

Figure 10. Top 30 subject distribution of Japanese authors' articles with the 67 disciplines level of the KAKENHI subject classification scheme.

User Feedback

In response to the KAKENHI subject classification scheme considering that a new function of InCites™ was released on April 2016, users in Japan were surveyed via an online questionnaire after a year: that is, in April 2017.

A total of 26 institutional users answered the questionnaire. They were mostly research administrators (RAs) and IR staff (Table 2).

TABLE 2

Table 2. Users' role in their institutions.

The questionnaire comprises 18 questions related to the subject classification schemes implemented in InCites™ and the attributes of users. An open-ended question was provided in the final part of the questionnaire.

To determine the users' degree of expertise, Q13 and Q3 were prepared. Q13 asks how often users utilize InCites™, whereas Q3 asks how broad the users' knowledge is regarding the KAKENHI subject classification scheme. The results indicate that most of the users periodically utilize the tool in their work and have sufficient expertise on the KAKENHI subject classification scheme (Figure 11).

FIGURE 11

Figure 11. Questions and answers on users' degree of expertise for InCites™ and the KAKENHI subject classification scheme.

With regard to the validity of the KAKENHI subject classification scheme, Q7 and Q11 were asked. Q7 investigates the necessary hierarchy level of the KAKENHI subject classification scheme. Q11 asks whether the users are comfortable with the analysis results when they use the KAKENHI subject classification scheme. The results of these questions indicate that users think they require both levels of hierarchy and are almost satisfied with the analysis results by using the KAKENHI subject classification scheme when compared with their experience with KAKENHI funding-related jobs (Figure 12).

FIGURE 12

Figure 12. Questions and answers on the validity of the KAKENHI subject classification scheme.

In the section of the questionnaire where further comments on the new feature of the KAKENHI subject classification scheme were encouraged, several users insisted on its usefulness. Moreover, users stated that they needed the same subject categories for other services and wanted them updated. Their exact comments were as follows:

• “I need the KAKENHI subject classification scheme in the Web of Science search service as well.”

• “I hope for updating the KAKENHI subject classification scheme to new one as possible. (It might be hard to catch up on updating it since it changes every year).”

• “Sixty-over categories of KAKENHI is not sufficient to relatively compare researches as much as ESI (22 only) and WoS (251, four times and more). And it may cause over-evaluation in comparison between research fields because the KAKENHI subject classification is made in a clock counter-like classification method. We need more accurate analysis of more concrete examples.”

Discussion

By analyzing the theory of our approach, that is, inducing a correspondence between the two subject classification schemes, we recognized its inherent limitation. The embedding subject classification scheme is unavoidably dependent on the original classification scheme. The topological space of the former is a subset of the topological space of the latter. However, we observed that each subject category of one scheme partially overlaps several subject categories of the other scheme based on the natural correlations between the subject categories of two subject classification schemes. No inclusion relationship exists between them. Therefore, the correspondence relations must be probabilistic.

In addition, we set strong assumptions on the relation among the research projects and journal articles in the research project database, in that they have similarities on the subject. However, the research projects and article outputs do have both similarities and differences on the subject. On the similarity side, we used the following procedure. A grants database reports that research projects produce outputs, that is, research articles. We focused on the subject classification scheme for the research projects and its relationship to a set of research articles. These articles were classified by using another subject classification scheme. Then, we compared the relationship of these two subject classification schemes. On the difference side, we have another issue. For example, the projects precede the articles. The time lag between project initiation and article outputs is observed, rendering a subject divergence or drift between them. Moreover, the projects tend to indicate the central concept using important keywords, allowing a subject diversification of the articles.

Nevertheless, users of InCites™ accepted the subject classification results. We assumed the following reasons. First, users might focus on the comparative analysis of bibliometrics based on the subject categories and not care about the specific case of articles. Second, they might require a rough quality of metrics during the evaluation stage. Metrics are the central limits of the quantitative attributes of a set of entities, which is the main indicator to be verified during the research evaluation.

Another advantage is that our approach requires less workload. In 2019, the number of WoS documents stored in InCites™ is 58,395,008, wherein the total number of journal titles amounts to 24,688. Thus, far, the possible targets for assigning subject categories are the WoS documents and journal titles. The journal titles include a set of documents. Furthermore, assigning subject categories to journal titles implies subsequently assigning them to the documents. In production, the WoS subject categories are primarily and exceptionally assigned to journal titles and documents in multidisciplinary journals. In our approach, we induced the correspondence between the WoS and KAKENHI subject classification schemes by using the KAKEN database. For the 251 WoS subject categories and 67 disciplines of the KAKENHI subject categories, the maximum relations in the correspondence are up to 16,817 (251 × 67). Regarding the 10 areas of KAKENHI subject categories, the maximum relations are up to 2,510 (251 × 10). The number for verifying the relations in our approach is overwhelmingly smaller than that of the original subject category manual assignment approach.

The evidence data are the contingency table whose sum of the frequency counts is 97,175. Specifically, this number is not sufficient for automatic decision making. When we assessed the correspondence between both subject classification schemes, the absence of relations is evident. The relations should be present in the literary meaning. Hence, manual handling was necessary for several subject categories. If the data size is sufficiently large, then we could predict the correspondence by using the data only.

Conclusions and Future Work

In this study, we proposed an approach to apply a new subject classification scheme for a bibliographic database that is already classified by using a subject classification scheme. We also defined the subject classification model of the bibliographic database comprising a topological space. Then, we presented our approach based on the model, wherein forming a compact topological space is necessary for a novel subject classification scheme. To form the space, the correspondence between the two subject classification schemes by using the research project database was utilized as data.

We applied the approach to a practical example, that is, InCites™. This tool is used as a world proprietary benchmarking tool for research evaluation based on the WoS citation database to add the subject classification scheme of Japan's largest national grants KAKENHI. Finally, InCites™ provides a function of analysis by using the KAKENHI subject classification scheme. The survey indicates that users generally accept the new feature.

In future work, several aspects are necessary to improve the quality of the database and embed subject classification schemes by using effective and efficient automatic procedures. In real cases, there exists a more complex subject classification scheme. Our approach assumes that the subject classification schemes consist of a flat formation. For a complex classification scheme such as a hierarchical classification scheme, our approach should be extended to be applied to its character. Alternatively, multilabel learning is another possible method to aim at our goal. A comparative study is needed to qualify our method.

Data Availability Statement

The datasets generated for this study are available on request to the corresponding author.

Author Contributions

All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.

Conflict of Interest

The authors declare that this study received funding from Clarivate Analytics, Co., Ltd. The funder was not involved in the study design, collection, analysis, interpretation of data, the writing of this article or the decision to submit it for publication.

Acknowledgments

This article is a result of a joint research between National Institute of Informatics and Clarivate Analytics, Co., Ltd. As for the databases we used in this article, the KAKEN database is provided by Scholarly and Academic Information Division, Cyber Science Infrastructure Development Department, National Institute of Informatics, and the Web of Science citation database is provided by Clarivate Analytics, Co., Ltd. We are thankful to the organizations who let us use the valuable assets.

Footnote

1. ^Clarivate Analytics. KAKEN Category Scheme - InCites Help. Available online at: http://help.prod-incites.com/inCites2Live/filterValuesGroup/researchAreaSchema/kaken.html (accessed February 21, 2019).

References

Aizawa, A., and Oyama, K. (2005). “A fast linkage detection scheme for multi-source information integration,” in International Workshop on Challenges in Web Information Retrieval and Integration (Tokyo: IEEE), 30–39.

Google Scholar

Bairi, R. B., Carman, M. J., and Ramakrishnan, G. (2016). “Beyond clustering,” in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management - CIKM '16 (New York, NY: ACM Press), 801–810.

Google Scholar

Bishop, C. M. (2006). Pattern Recognition and Machine Learning. New York, NY: Springer.

Google Scholar

Büyükçakir, A., Bonab, H., and Can, F. (2018). “A novel online stacked ensemble for multi-label stream classification,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18 (New York, NY: ACM Press), 1063–1072.

Google Scholar

Chang, X., Yu, Y.-L., and Yang, Y. (2017). “Robust top- k multiclass SVM for visual category recognition,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '17 (New York, NY: ACM Press), 75–83.

Google Scholar

Gómez, I., Bordons, M., Fernández, M. T., and Méndez, A. (1996). Coping with the problem of subject classification diversity. Scientometrics 35, 223–235.

Google Scholar

Han, J., Kamber, M., and Pei, J. (2011). Data Mining : Concepts and Techniques. Waltham, MA: Morgan Kaufmann, an imprint of Elsevier.

Google Scholar

Hjørland, B. (2008). What is knowledge organization (KO)? Knowl. Organ. 35, 86–101. doi: 10.5771/0943-7444-2008-2-3-86

CrossRef Full Text | Google Scholar

Jain, A. K., Murty, M. N., and Flynn, P. J. (1999). Data clustering: a review. ACM Comput. Surv. 31, 264–323. doi: 10.1145/331499.331504

CrossRef Full Text | Google Scholar

Koch, T., Day, M., Brümmer, A., Hiom, D., Peereboom, M., Poulter, A., et al. (1997). The Role of Classification Schemes in Internet Resource Description and Discovery. Bath: UKOLN, University of Bath.

Google Scholar

Kurakawa, K., Sun, Y., and Aizawa, A. (2014). Mapping Between Research Fields of Grants-in-Aid for Scientific Research and Web of Science Subject Areas. NII Technical Reports, National Institute of Informatics. Available online at: https://www.nii.ac.jp/TechReports/public_html/14-002J.html (accessed August 31, 2019).

Google Scholar

Liu, J., Chang, W.-C., Wu, Y., and Yang, Y. (2017). “Deep learning for extreme multi-label text classification,” in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '17 (New York, NY: ACM Press), 115–124.

Google Scholar

Mai, F., Galke, L., and Scherp, A. (2018). “Using deep learning for title-based semantic subject indexing to reach competitive performance to full-text,” in Proceedings of the 18th ACM/IEEE on Joint Conference on Digital Libraries - JCDL '18 (New York, NY: ACM Press), 169–178.

Google Scholar

Manning, C. D., Raghavan, P., and Schütze, H. (2008). Introduction to Information Retrieval. Cambridge: Cambridge University Press.

Google Scholar

Maron, M. E. (1961). Automatic indexing: an experimental inquiry. J. ACM 8, 404–417.

Google Scholar

Martínez-Mekler, G., Alvarez Martínez, R., Beltrán del Río, M., Mansilla, R., Miramontes, P., and Cocho, G. (2009). Universality of rank-ordering distributions in the arts and sciences. PLoS ONE 4:e4791. doi: 10.1371/journal.pone.0004791

PubMed Abstract | CrossRef Full Text | Google Scholar

Newman, M. (2005). Power laws, Pareto distributions and Zipf's law. Contemp. Phys. 46, 323–351. doi: 10.1080/00107510500052444

CrossRef Full Text | Google Scholar

Sebastiani, F. (2002). Machine learning in automated text categorization. ACM Comput. Surv. 34, 1–47. doi: 10.1145/505282.505283

CrossRef Full Text | Google Scholar

Slavic, A. (2011). “Classification revisited: a web of knowledge,” in Innovations in Information Retrieval: Perspectives for Theory and Practice, eds A. Foster and P. Rafferty (London: Facet Publishing), 23–48.

Google Scholar

Tagami, Y. (2017). “AnnexML,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '17 (New York, NY: ACM Press), 55–464.

Google Scholar

Wang, P., Yang, Z., Niu, S., Zhang, Y., Zhang, L., and Niu, S. (2018). “Modeling dynamic pairwise attention for crime classification over legal articles,” in The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval - SIGIR '18 (New York, NY: ACM Press), 485–494.

Google Scholar

Xie, C., Chen, L., Liang, J., Zhang, K., Xiao, Y., Tong, H., et al. (2017). “Automatic navbox generation by interpretable clustering over linked entities,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management - CIKM '17 (New York, NY: ACM Press), 1857–1865.

Google Scholar