Experiments with Neural Networks for Small and Large Scale Authorship Verification

03/17/2018 ∙ by Marjan Hosseinia, et al. ∙ University of Houston 0

We propose two models for a special case of authorship verification problem. The task is to investigate whether the two documents of a given pair are written by the same author. We consider the authorship verification problem for both small and large scale datasets. The underlying small-scale problem has two main challenges: First, the authors of the documents are unknown to us because no previous writing samples are available. Second, the two documents are short (a few hundred to a few thousand words) and may differ considerably in the genre and/or topic. To solve it we propose transformation encoder to transform one document of the pair into the other. This document transformation generates a loss which is used as a recognizable feature to verify if the authors of the pair are identical. For the large scale problem where various authors are engaged and more examples are available with larger length, a parallel recurrent neural network is proposed. It compares the language models of the two documents. We evaluate our methods on various types of datasets including Authorship Identification datasets of PAN competition, Amazon reviews, and machine learning articles. Experiments show that both methods achieve stable and competitive performance compared to the baselines.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

In this paper, we consider the problem of Authorship Verification (AV) which is a branch of forensic authorship analysis. When given two text documents, we look to verify whether the two documents are written by the same author while no previous writing samples of their author/authors have been specified.

Majority of online services work on textual communications between users. Their overall reliability and performance can be impacted by someone who abuses the application and provides scripts while hiding their real identity and pretending to be someone else. To preserve the reliability of such services, the identity of the users should be monitored based on their provided scripts. The authorship verification techniques match the identity of the users with their writing styles. Indeed, authorship verification has an important impact on online document analysis such as plagiarism analysis, sockpuppet detection, blackmailing and email spoofing prevention, to name a few [6].

Traditionally, the studies on AV problem considered a closed and limited set of authors and a closed set of documents written by those authors. During the training step some of these documents (which were sometimes as long as a whole novel) were observed. Then, the problem was to identify whether the authors of a pair of the documents from the rest of the document set were identical [1, 2, 5]. This type of AV problem benefits from having access to the writing samples of future authors during the training step which is not always realistic. Actually, this structure is static and is not compatible with new future unseen authors. Recently, the structure of AV problem has changed and became more challenging. Based on the new structure, we are given some document pairs with their binary authorship status. The same-authorship status indicates that both are written by one author while the different-authorship status shows the pairs are written by two individual authors. Based on this binary structure the goal is no longer to learn the writing style of each underlying authors individually (like in the traditional AV methods) but is to learn the difference or similarity of the writing styles of the two types of document pairs.

In this paper we define two different schemas to study the AV problem. Under the first schema we address the following challenges: 1- writing samples of available authors are quite limited during the training step as the length of the given text documents is short (a few hundred to a few thousand words) and size of the training set is so small (from 10 to 200 examples). So, it is quite hard to infer the same or different-authorship status of given pairs. 2- The test and train documents are from different genera and/or topics which makes the learning and prediction process much harder as the word distribution might differ considerably. 3- No writing samples of the future authors is specified to us during the training and we may have seen no samples by the future authors at all. Under the second schema the scale of the training data is larger compared to the first schema. However, we address the problem of identifying the difference in documents from identical domains in two ways: 1- authorship diversity in similar contents by utilizing Amazon reviews from distinct authors. 2- Scientific documents from the same area of research by different authors who have almost identical level of expertise in the field. It also can be considered as an application of plagiarism detection.

We analyze authorship verification on several datasets with binary structure. To our knowledge this amount of analysis has not been done in authorship verification on diverse types of datasets. Two models are proposed. First, a Transformation Encoder (TE) to model error feature vectors for classification inspired by the idea of autoencoders. TE is compatible with the AV problems with small-scale training sets. Giving a pair of input documents, TE transforms one input into the other. In this process, the transformation loss is observed as a reasonable measure of closeness of the two inputs to be used by a classifier. The second model is a parallel recurrent neural network (PRNN) that is inspired by the popular similarity measures in Statistical Machine Learning (ML). Being based on language models, it is mostly applicable for relatively larger datasets. PRNN compares the proximity of the language model of its two input sequences to investigate their authorship. We also propose the

summary vector to adapt our problem to a common binary classification style to create strong baselines as there are limited studies in authorship verification according to the literature. Applying this adaptation we are able to employ the recognized classifiers as well as similarity measures that are widely used in ML to build our baselines. Besides, the two pre-existing datasets, Amazon reviews and MPLA-400, are mapped to the binary structure to be used for our large scale AV problem.

Experimental results on evaluation datasets show that both methods achieve stable and competitive performance compared to the baselines.

2 System Design

Let denotes a pair of documents, indicating as the source and as the target. Here, the task is to investigate whether and are written by the same author. We map this problem into a binary classification paradigm. Accordingly, if and are authored by the same person, belongs to the positive class. Nevertheless ( and have different authors)

belongs to the negative class. In the first step, we explain the Transformation Encoder which is a feature extraction-based method designed for the small-scale datasets with

labeled samples at most. However, many AV problems might have a larger scale with much more examples. So, we introduce the Parallel Recurrent Neural Network (PRNN) for large scale datasets in the second step.

2.1 Transformation Encoder (TE)

TE is inspired by the idea of an autoencoder. A typical autoencoder neural network is a kind of unsupervised learner exploiting backpropagation in order to reconstruct a given input. In other words, it tries to approximate the identity function. Given an unlabeled input

, the goal is to learn and such that . It is usually a three-layer neural network, with one input, one hidden and one output layer. is a transformation matrix that encodes a -dimensional input vector into the mostly lower dimension . Then, a non-linear function such as sigmoid will apply to the sum of the transformed vector and a bias to make the new vector in the hidden layer. Finally, the output will be decoded by applying the same process on with , usually , and bias . Therefore, the goal is to minimize the loss, also known as reconstruction error. To build the Transformation Encoder (Figure 1) we add a new input to the structure of autoencoder and modify its reconstruction process. So, TE has two inputs known as source and target. Let be the first and be the second input of TE. However, the goal is no longer the reconstruction of one input similar to itself but is to learn a transformation function that reconstructs the source input similar to the target input , i.e., . Indeed, only the source () passes the reconstruction process (encoding and decoding layers). So, the following steps are kept intact according to a typical autoencoder: where is the reconstructed input and must be transformed into the target (). This can be done by setting TE’s objective function as the minimization of the transformation loss. We set the TE transformation loss to be the cross-entropy between reconstructed input () and the target input () as: .

Now, we assign our authorship verification problem into the proposed Transformation Encoder. It is intuitively expected that TE shows different manner when it transforms the source into the target while both having many features in common compared to the case where they have less common features. Here, the goal is to utilize TE for the AV problems that suffer from restricted labeled data. So, we put a document expansion method on top of TE as an initial step to overcome the restriction to some extent.

2.1.1 Document Expansion for Small Scale Datasets

Neural networks need sufficient amounts of data during their learning process to avoid the over-fitting problem to produce the desired output. So, we propose a document expansion method to make use of the existing labeled training data of small scale datasets such as PAN to a great extent. A sliding window with the length of sentences moves forward through each text document by one sentence per step making a smaller document each time. More specifically, a document with sentences will be distributed into smaller documents. New line characters, as well as empty sentences, are ignored here. So, using this expansion technique each problem in the small datasets will be converted to where and are the set of all shorter documents after expansion of and (source and target). and denote the size of and respectively.

Figure 1: Transformation Encoder (TE). : feature vector of document after expansion of the source document , : average feature vector of expanded target document . The dotted line emphasizes that the reconstructed source should be similar to the target. Figure 2: PRNN architecture. The network takes two input in parallel and fuses them after passing word embedding and recurrent layers.

2.1.2 Utilizing TE

We represent the documents of and under vector space model. The details are explained in section 3.2. Under one feature set let and denote the document feature vectors of and under vector space model for a problem respectively. As mentioned earlier, the goal is to transform the source to the target. However, we have expanded the target document into multiple smaller documents. So, we need to have one single target to be the shared target for all the source documents. We compute the average vector of all feature vectors of target documents as the target input of the TE under vector space model. The average vector is a representative of all features without ignoring any of them despite other techniques such as min/max that only consider the most or least frequent features. The documents are represented under feature sets separately. So, under this paradigm all feature vectors will be transformed into one single target (). So, where is the feature vector of short target document () for one problem and is the total number of them. Thus, the final transformation loss of is the average transformation loss of TE across all (the reconstruction of ) and : . The value is the TE error under th feature set () for a pair of documents and the critical feature value for a classifier to predict the class label of the given pair. Now, we let be the TE transformation error vector of the problem where is the total number of feature sets (at most ). The TE error vector consisting of transformation errors under different feature sets will be the input of a binary classifier. These transformation errors are the features to differentiate the pairs in distinct classes. Under this paradigm, the AV problem is mapped to an ordinary binary classification where the TE error vector of a same-authorship document pair belongs to the positive class and the TE error vector of a different-authorship document pair is a member of the negative class.

2.2 Parallel Recurrent Neural Network (PRNN)

PRNN is designed to solve the AV problem for relatively large scale datasets. The structure of the problem is the same as TE’s. We model a pair of documents using a simple parallel recurrent architecture. The overall model is shown in Figure 2

. In general, PRNN consists of three components: two parallel columns of identical layers, one shared fusion layer and a SoftMax layer as the output. We proceed to describe the network in the following paragraphs.

2.2.1 Parallel columns of embedding and recurrent layers

Given two documents, the network takes each document as the input of one of the parallel columns separately. In each column, the network embeds all words of the input document through an embedding matrix where is the size of the vocabulary and is the embedding dimension. Then, a fully-connected RNN where the output is to be fed back to its input takes the embedding matrix of the previous layer. The RNN layer of our model at time includes: where is the word embedding vector; and

are the bias vectors;

, and are the weight matrices. We only take , the output at the last time step , as the output of the recurrent layer. Finally, to avoid over-fitting problem we apply dropout regularization to the output of the recurrent layer. It helps the network to generalize the learnt language models.

2.2.2 Fusion layer

Let be the output of the final (RNN) layers after dropout of the two parallel columns. We add a shared fusion layer to fuse by computing several popular similarity measures between them. The resulting fusion vector, , is computed as: , where each function belongs to one of the functions in Table 2. Finally, the output layer classifies the fusion vector using a SoftMax function.

3 Experiment Design

As the two proposed methods uses different techniques for verification, our experiments to evaluate them are done in two distinct settings: 1-TE schema for Transformation Encoder method, 2-PRNN schema for Parallel RNN.

Dataset Train Test PAN2013 10 30 PAN2014E 200 200 PAN2014N 100 200 PAN2015 100 500 Dataset Positive Negative Amazon 4500 4500 MPLA* 720 720
Table 1: Datasets information
Metric Description Chi2 kernel Cosine similarity Euclidean Linear kernel RBF kernel Mean of L1 norm Sigmoid kernel
Table 2: Similarity functions. : document feature vectors, : number of features in and

3.1 Dataset

TE schema To evaluate the Transformation Encoder we use all available authorship identification datasets released by PAN 111http://pan.webis.de/data.html (Table 2). Each PAN dataset consists of a training and test corpus and each corpus has a various number of distinct problems. One problem is a pair of two documents: the first document of a problem composed of up to five writings (even as few as one) by a single person (implicitly disjoint For PAN2014 and PAN2015 and explicitly disjoint for PAN2013), and literally the second document includes one piece of writing. Two documents of a pair might be from significantly various genres and topics. The length of a document changes from a few hundred to a few thousand words. PAN2014 includes two datasets: Essays and Novels. The paired documents in PAN datasets are used for our experiments. So, for a problem , (source) is the first document and (target) is the second document of a PAN problem.
PRNN schema We evaluate PRNN on new schemas of MPLA-400 222https://github.com/dainis-boumber/MLP-400-datasets and Amazon reviews. The schemas are defined similarly to the PAN-style explained above. MPLA-400 dataset contains 20 articles by each of the top-20 authors by citation in Machine Learning. We create its new schema, MPLA*, by selecting publications from MPLA-400 that are written by a single author and have no co-authors. To keep the distribution of authors and classes balanced in MPLA*, we select an equal number of single-authorship articles from all existing 20 authors and map it to the PAN-style (there are at most 9 single-author publications by each author). Here, the positive class consists of the pairs which are made up of all possible combinations of same-authorship articles (). And the same size negative class includes the pairs that are randomly selected from the set of all unique combinations of different-authorship articles. We apply the similar method to Amazon review dataset to define its new PAN-style schema. We select authors with at least reviews to make the positive and negative candidate sets. Then, for each author, the positive candidate set is all possible and unique combinations of the author’s reviews. To make a positive class we choose 4500 review pairs from this positive candidate set at random. On the other hand, the negative candidate set is made of all unique and possible combinations of review pairs having different authors. The negative class having equal size with the positive class is created by random selection from the negative candidate set.

3.2 Feature Sets and Experiment Settings

TE schema All documents of and are represented in vector space model under several feature sets with term frequency and boolean feature value assignment separately. Seven feature sets are used: 1-unigram, 2-bigram, 3-trigram, 4-four-gram, 5-unigram Part Of Speech (POS), 6-bigram POS, 7-char-4gram 333 we use scikit-learn software for all linguistic features. Note that for each transformation using TE and

are represented under one feature set with one feature value assignment. TE is implemented based on Theano

444http://deeplearning.net/software/theano/. The size of the hidden layer is reduced to 50% of the input layer size with batch size=1 and learning rate=0.1. All classifiers and metrics are implemented by scikit-learn library [3]

. Gussian distribution is chosen for Naive Bayes. For K-Nearest Neighbor we set K=3. The L-2 regularization is used for Logistic Regression. For document expansion, we set the size of the sliding window to

. On average it expands one document into smaller documents for PAN datasets. All other parameters are selected based on pilot experiments. We report accuracy, the Area Under Receiver Operating Characteristic (ROC) curve [4] (AUC) and ScoreAUC Acc in TE experiments. The higher AUC and Score indicate more effective classification.
PRNN schema

The plain text of each document is used as the input of PRNN. The features sets for the baselines are the same as the TE baselines. However, we did not use the original training and test sets of the PAN datasets as the size of the training set is too small to be used for PRNN. To avoid overfitting problem we perform 5-fold Cross Validation (CV) for the PAN2015, Amazon and MPLA* where we have sufficient amount of examples in training folds. And for the PAN2013, PAN2014E and PAN2014N datasets that are relatively smaller we perform 10-fold CV to increase the size of the training folds. This setting is applied for PRNN as well as the baselines. We use Theano to implement PRNN. All classifier’s parameters are the same as the TE schema. The back-propagation is done using stochastic gradient descent with learning rate=0.001, batch size=1, and dropout rate=0.2. We use the Glove pre-trained vectors

555https://nlp.stanford.edu/projects/glove/

as an initial value for the embedding vectors when there is a match. Otherwise, a random vector from a continuous uniform distribution over

is used.

3.3 Comparison Methods under TE Schema

Here, the comparison methods are presented in three categories: baseline, PAN winners and our TE method. The details are provided as follows.
Baseline: We connect several Machine Learning reliable classifiers widely used in the area with the seven similarity measures to set strong baselines (Table2). Since each example in our underlying dataset structure comprises two documents, we need to adapt it to the structure of an ordinary classifier input by converting them to one single entity. A simple direct way is to concatenate their feature vectors. However, our experiments show it provides weak results mostly equal to the random label assignment. So, we define the summary vector as a single unit representative of each example/problem by utilizing several similarity measures. The summary vector comprises a class of several metrics each measures one aspect of the closeness of the two documents ( and ) of the pair for all underlying feature sets. For any two feature vector documents their summary vector is where computes the similarity metric of metrics in Table 2 under of feature sets (Section 3.2) between . Then, we use a classifier including SVM, Gaussian Naive Bayes (GNB), K-Nearest Neighbor (KNN), Logistic Regression (LR

), Decision Tree (

DT) and Multi-Layer Perception (MLP) to predict the class label.
PAN winners: We compare our method with the top methods of PAN AV competition between 2013 and 2015. The results of each method for one year of the competition are available and we report them here. So, our comparisons are not impacted by different parameter setting and implementation details of these methods as long as we keep the test and training sets the same as theirs.
TE methods: We perform the Transformation Encoder (TE) on a problem that its documents are represented under one feature set with one feature value assignment to compute the transformation error. We then leverage the error rates taking from (at most) feature sets (Section 3.2) of TE to form the final TE feature vector (). Indeed, Each of the dimensions captures the transformation loss of one feature set. We apply the TE to both training and test data. Two well-known GNB and DT classifiers are used for verification. We indicate them as TE+GNB and TE+DT respectively in our experiments.

3.4 Comparison Methods under PRNN Schema

Here, the baselines are the same as the TE schema. However, we are not able to compare the PAN winner methods with our model as they have not published their code and many implementation details are left unknown to us in their reports to reimplement their methods. We call our second model PRNN in our reports.

PAN2014E PAN2014N
Category Method Acc. AUC Score Acc. AUC Score

baseline

SVM 0.605 0.309 0.187 0.57 0.265 0.151
GNB 0.675 0.728 0.491 0.515 0.604 0.311
LR 0.675 0.741 0.5 0.56 0.743 0.416
KNN 0.64 0.689 0.441 0.55 0.611 0.336
DT 0.64 0.675 0.432 0.545 0.545 0.297
MLP 0.7 0.768 0.538 0.54 0.782 0.422

PAN

FCMC 0.58 0.602 0.349 0.71 0.711 0.508
OCT 0.71 0.72 0.511 0.59 0.61 0.36

TE

TE+GNB 0.655 0.676 0.443 0.685 0.692 0.474
TE+DT 0.67 0.675 0.452 0.695 0.7 0.487
(A)
PAN2013 PAN2015
Category Method Acc. AUC Score Acc. AUC Score

baseline

SVM 0.633 0.29 0.184 0.5 0.215 0.107
GNB 0.633 0.795 0.503 0.552 0.78 0.431
LR 0.7 0.781 0.547 0.544 0.796 0.433
KNN 0.633 0.645 0.409 0.478 0.464 0.222
DT 0.633 0.621 0.393 0.558 0.4 0.223
MLP 0.533 0.5 0.267 0.554 0.687 0.381

PAN

MRNN - - - 0.76 0.81 0.61
Castro - - - 0.694 0.75 0.52
Mezaruiz - - - 0.694 0.739 0.513
IM 0.8 0.792 0.634 - - -

TE

TE+GNB 0.8 0.835 0.668 0.748 0.75 0.561
TE+DT 0.767 0.772 0.592 0.71 0.704 0.5
(B)
Table 3: Classification results for TE schema. All settings are kept intact according to the PAN competition. The input for the baselines are empowered by the proposed similarity vector.
Methods MPLA* Amazon PAN2013 PAN2014E PAN2014N PAN2015
PRNN 0.703 0.922 0.72 0.691 0.81 0.802
SVM 0.621 0.818 0.525 0.659 0.673 0.628
NB 0.635 0.741 0.587 0.652 0.69 0.728
LR 0.671 0.839 0.581 0.676 0.707 0.675
KNN 0.64 0.831 0.731 0.656 0.75 0.757
DT 0.628 0.818 0.656 0.644 0.717 0.73
MLP 0.686 0.858 0.65 0.589 0.76 0.737
Table 4: Classification accuracy for PRNN schema using 5 and 10-fold CV across different datasets. The input for the baselines are empowered by the proposed similarity vector.

3.5 Results and Analysis

TE schema The classification results are compared in Table 3. The highest accuracy is indicated in bold and the second highest is underlined. For PAN2014N (Table 3(A)) TE+GNB and TE+DT methods beat the best baseline accuracy (SVM)by more than percent and approach to the PAN winner by percent. For PAN2014E, TE methods overcome half of baselines and FCMC in terms of accuracy. This might be because of PAN2014E short documents compared to the PAN2014N making it harder to discriminate the employed transformation loss for positive and negative data. However, no PAN winner stays stable at the first rank in both Essays and Novels datasets. While FCMC works quite appropriately for the PAN2014N and is the winner of that year, it achieves the lowest accuracy compared to the baselines for PAN2014E. Furthermore, none of the best 2014 PAN methods (FCMC and OCT) works stably for the two genres (Novels and Essays) simultaneously. They gain the highest score in only one genre and have a large difference with the winner indicating the dependency of their method on the context while the two TE methods get close to the winners reasonably. The results for PAN2013 and PAN2015, the dataset with the largest test set (500 pairs), are provided in (Table  3(B)). According to them, IM and TE+GNB beat the other results although most results for the PAN2013 dataset are almost close to each other in terms of accuracy. For PAN2015, Both TE+GNB and TE+DT can beat the accuracy of all the baselines. TE+GNB also shows a reasonable result while its accuracy is percent less than the best method (MRNN) and again stays at the second accuracy and score rank. Figure 3 shows the TE transformation loss averaged over problems of the training set and

problems of the test set of PAN2015 for both classes. The underlying feature set is unigram. The figures show that in both training and test sets the TE loss of the two classes decreases as the transformation encoder updates its weights in each epoch. However, there is a difference between the transformation loss of the positive and negative data in both diagrams. The loss of negative data is less than the positive’s. In other words, it is easier to transform one document into the other while they are a different-authorship pair (negative pair) compared to a same-authorship pair (positive pair). It makes the results of reconstruction loss to be counterintuitive. The reason is that we represent both documents of each problem under vector space model and only based on the vocabulary of the source document. So, the exclusive features of the target document, the features that only belong to the target but no to the source document, will be filtered under this document representation model. Moreover, it is expected that the documents written by different authors have fewer features in common and have more exclusive features than the ones written by the same author. This fact makes the target document of different-authorship pair sparser than that of the same-authorship pair. And transforming the source document into a sparse document (its vector is sparse) makes less error than to a dense document (its vector is dense). This feature differentiates the positive and negative data and exists for both training and test sets and makes the transformation loss a distinctive feature for the verification. A more direct way to classify the documents (instead of using classifiers) is to simply thresholding the reconstruction error. However, it is only precise for one or two feature sets. So, we employed the NB and DT for classification. We also tried SVM for this step but its results were not as precise as the two DT and GNB classifiers. One reason might be that SVM cannot recognize the decision boundary for very low dimensional TE error vectors (at most

feature sets).
PRNN schema The comparison results are reported in Table  4. According to it, PRNN beats all baselines for all datasets except PAN2013 where it achieves the second highest accuracy. The best accuracy belongs to the Amazon dataset where we have the largest dataset. It can be inferred that when the scale of the underlying dataset is large enough, the network learns the relation between the two language models of its given inputs well. It should be noted that for the two PAN2013 and PAN2014E even after CV the network cannot converge and the validation loss increases after each epoch. To avoid it we increase the total number of document pairs by splitting each document into two smaller ones with an equal number of sentences and making new pairs. This technique decreases the validation loss during training. However, it still suffers from lack of labeled examples and causes weakest results compared to the other larger datasets. To illustrate how PRNN discriminate writing styles we provide the t-SNE plot of the output of the fusion layer in a 5-fold CV classification for two folds of PAN2015 (Figure 4). According to Figure 4

, both classes have almost similar distribution in the test and training data. But, in some rare parts, the positive and negative points are close. They are probably the portion of the data that mislead the classifier during the training step or will be misclassified in predictions.

Figure 3: Transformation loss for 50 epochs: averaged over all problems in the PAN2015 dataset. (A): training data (100 problems), (B): test data (500 problems), Feature set: unigram.
Figure 4: t-SNE plot of two folds of output of the fusion layer for PAN2015 in 5-fold CV. : positive training data, : positive test data, : negative training data, : negative test data

4 Related Work

In majority of AV approaches the authors are known to us and a verifier trains the language model of the future authors [5], [1], [2], [6]. But, in a more difficult case no writing samples of a questioned author are specified and they are unknown to us. No general solution has been offered for the verification problem under this assumption till 2014 [7]. Since then, a few works can be found in the literature: Koppel and Winter [7] propose an almost unsupervised method for the blog corpus dataset using “impostors” method. Optimized Classification Trees, the winner method of PAN2014 Essays dataset, optimizes a decision tree based on various types of features and different comparison methods including cosine similarity, correlation coefficient and euclidean distance [8]. Multi-headed RNN is a character-level RNN and contains a common recurrent state among all authors with an independent softmax output per author [9]. Fuzzy C-Means clustering, the winner of the PAN2014 competition for novels dataset, adopts C-Means clustering and lexical features for the task [10]. Recently, an approach based on the compression models has been evaluated on PAN datasets [11]. Their method achieves promising results for the two years of PAN competitions but not for the other two datasets. Our methods is similar to these methods and considers the problems with the binary structure but we examine them on all PAN small-scale datasets as well as two large scale datasets.

5 Conclusion

Authorship verification has always been a challenging problem. It can be even more difficult when no writing samples of questioned author/authors is given. In this paper, we proposed Transformation Encoder (TE) and Parallel Recurrent Neural Network (PRNN) for small and large scale datasets. TE transforms one document of the pair into the other and observes the transformation loss as a distinctive feature for classification. PRNN investigates the difference between the language models of documents. Experiments show that TE can achieve stable results in all four PAN datasets with various size, genre and/or topics. Also, PRNN beats almost all baselines avoiding over-fitting problem by a reasonable amount of training data.

Acknowledgments

This work is supported in part by NSF 1527364. We would like to thank the anonymous reviewers for their helpful comments.

References

  • [1] Koppel, M., Schler, J.: Authorship verification as a one-class classification problem. In: Proceedings of the twenty-first international conference on Machine learning, ACM (2004)  62
  • [2] Manevitz, L., Yousef, M.: One-class document classification via neural networks. Neurocomputing 70 (2007) 1466–1481
  • [3] Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al.: Scikit-learn: Machine learning in python. Journal of Machine Learning Research 12 (2011) 2825–2830
  • [4] Egan, J.P.: Signal detection theory and ROC analysis. Academic Press (1975)
  • [5] Japkowicz, N., Myers, C., Gluck, M., et al.:

    A novelty detection approach to classification.

    In: IJCAI. Volume 1. (1995) 518–523
  • [6] Hosseinia, M., Mukherjee, A.: Detecting sockpuppets in deceptive opinion spam. arXiv preprint arXiv:1703.03149 (2017)
  • [7] Koppel, M., Winter, Y.: Determining if two documents are written by the same author. Journal of the Association for Information Science and Technology 65 (2014) 178–187
  • [8] Frery, J., Largeron, C., Juganaru-Mathieu, M.: Ujm at clef in author verification based on optimized classification trees. In: CLEF 2014. (2014)  7p
  • [9] Bagnall, D.: Author identification using multi-headed recurrent neural networks. arXiv preprint arXiv:1506.04891 (2015)
  • [10] Modaresi, P., Gross, P.: A language independent author verifier using fuzzy c-means clustering. In: CLEF (Working Notes). (2014) 1084–1091
  • [11] Halvani, O., Winter, C., Graner, L.: On the usefulness of compression models for authorship verification. In: Proceedings of the 12th International Conference on Availability, Reliability and Security, ACM (2017)  54