every human voice is unique   as it was found to be quantitatively composed of components called phonemes that have a pitch , cadence , and inflection .
hence human voice has been used as one of the popular biometrics in biosecurity applications ; it can be used to authenticate a person 's identity ( identification ) and control access ( authentication and verification ) to a protected resource . unlike other biological traits , like fingerprints and iris scans , voiceprints are relatively vulnerable to replay attack .
much of the research works have been devoted to finding improved solutions in the hope of strengthening voiceprints for meeting high demands of security applications .
some popular techniques include multimodal authentication that fused audio , visual , and other forms of biometrics into one .
since then , voice biometrics has been largely geared towards the security directions of biometric identification and biometric verification .
voice biometrics is used either alone or in combination with other biometrics . in voice verification ( vv ) , a voiceprint of a speaker who claims to be who he is , is presented to the biometrics system for a one - to - one checking of the reference voiceprint which is stored in a database .
once he is successfully verified with a match , subsequent access rights would be granted to him .
the other type of checking called voice identification ( vi ) relies on a one - to - many checking for identifying a previously unknown voiceprint .
the unlabelled voiceprint under question is searching through the whole database with the aim of finding a match of an already known sample .
we can see that both vv and vi require a priori condition that a set of voiceprints must have already been known for the matching of new samples to proceed .
this is akin to database query or supervised learning where preknown samples must be initially used to train up a decision model , so testing and matching of new sample can follow .
what if in a scenario where a handful of unknown voiceprints are collected , but we wish to obtain some information about them ? such scenarios may include but not limited to security surveillance problems   where a list of voice traces are captured from a monitored area , how many unique speakers there are , their ages , and genders , and from their speech accents which ethnic backgrounds these people belong to ; customer - service applications where callers will be automatically classified from their tones to categories of their needs and emotions .
it was only until recently , voice classification ( vc ) that attempts to determine if a speaker should be classified to a particular characteristic group rather than to a particular individual has gained popularity .
vc can help complement the security of vv and vi systems too . in figure 2 an example of a voice biometric system
is being compromised ; through hacking , the content of a voiceprint b is modified to that of another voiceprint ( let us say a ) that has a higher access authority .
because the database of the voiceprints just like an encrypted list of passwords in a file system is accessed individually , each voiceprint is protected independently ; allowing the existence of two same voiceprints goes undetected .
so an imposter with b can cheat gaining a restricted access right by matching b to a in a vi system .
vc could be used to prevent this fraud by checking how many unique items there are in different groups .
if extra voiceprints suddenly emerge or have gone missing from a group , the integrities of the voiceprints must have changed .   for developing a vc system ,
several approaches have been studied , such as artificial neural networks ( ann ) , support vector machines ( svms ) , hidden markov models ( hmms ) and gaussian mixture models ( gmms ) .
they have been used heavily for training up a model with predefined voice samples for voice recognition .  
table 1 shows a summary of the techniques by which majority of research works used .
these techniques generally function like a black box ; for instance , the weights for mapping the relations of the inputs to the outputs are in plain numeric , the kernel parameters are used for low - level computation , and so forth .
they require a full set of known samples to be available before they can be tuned up for actual use . in this paper
voiceprints who share similar features will be placed into distinctive groups that represent some labels about the speakers . subsequently a decision tree ( classifier ) can be built after studying and confirming the characteristic groups .
the advantage of decision tree is that easily comprehensible rules in terms of if - then - else conditions can be generated when the decision tree is constructed .
using the features of a human voice as a voice classifier for classifying speakers has not been researched a great extent although it has a large implication in voice biometrics applications .
to the best of the author 's knowledge , nobody has applied such techniques of vc before .
this is the research focus of this paper ; a collection of algorithms are introduced for supporting grouping unlabeled voiceprints and then subsequently classifying new incoming voiceprints .
they can be used for checking the integrity of the groups of voiceprints for solving the security problem that is illustrated in figure 2 .
the contribution of this paper is an alternative computation platform for realizing voice classification ; the algorithms are relatively simpler than the existing ones and fellow researchers that can easily adopt them for implementing vc systems .
the model that we proposed aims at providing a generic voice classification framework under which a collection of algorithms such as hierarchical time series clustering , dynamic time wrap transform , discrete wavelet transform and decision tree would have to work together .
the prominent advantage is its generic property that can be applied across a variety of applications that capitalize on voice classification . while the inputs are previously unknown voices , the voices would be automatically grouped together according to their own characteristics .
each group or cluster being formed as an output represents one pronounced characteristic which is shared in common by all the voice samples inside ( total = n ) .
our model assumes that the collected voices in waveforms would be recorded in the format of time series .
each time series is a vector of numeric data points that can be represented by a set of m attribute values , such as a time series s = [ x1 , x2 ,  , xm ] . in a collected dataset
whose speakers ' identities are not known , a sufficient amount of voice samples are gathered from each speaker and these samples can then be clustered by using hierarchical time series clustering algorithm .
clustering is done based on the characteristics of the voice samples themselves . at this point
no classification area was sought specifically , for instance gender or ethnic background , as it was preferred to allow the results to decide the characteristics that lead to a particular clustering group .   as shown in figure 3 , an example scenario by the proposed model
is a surveillance eavesdropper that collects from a secret meeting a total of n voice traces .
the voice traces may be spoken by more than one speaker , one trace per speaker at a time , and each voice trace can be encoded by m coefficient attributes regardless of how long the conversation is .
the voices that are in the form of time series can be submitted for hierarchical clustering for self - grouping .
hierarchical clustering instead of others is applied because it gives a layered structure of groupings which we do not know in advance in different resolutions .
after the clustering , not only we know how the speakers whose voices are distinctively grouped , the number of unique voices ( hence the number of speakers ) can also be identified . in essence , it may be possible to infer from the groupings that how many speakers there are in the meeting , what characteristics they have in each group .
however , it requires further verification and probably extra information to infer detailed assertions such as gender , age , and the emotions of the speech . with the groupings available
a voice classifier can be developed after the unlabeled voice traces labeled with the classes derived from the characteristics of the groups .
so that in our model , unsupervised learning by clustering comes first , and then supervised learning for building the decision tree follows .
the voice traces in the form of labeled time series can be used as training data to build a classifier . however , in our experiment , we opt to transform the voice traces from time domain to frequency domain , as our experiment results show that the accuracy performance of the classifier can be significantly improved .
when the classifier is ready , future new voice samples can be automatically classified into the characteristic groups . if necessary , the process of hierarchical clustering can be applied on the new samples again in case new characteristics from the voice samples may be discovered .
the goal of time series clustering is to identify the speaker category to which a voice belongs given the multivariate time series points of each voice trace . in our experiments the synthetic control wave dataset and empirical datasets from uci data archive
the wave has 60 coefficients and the live japanese vowel data each wave is characterized by 12 coefficients .
similar waves cling together to form a cluster , and dissimilar waves tend to stay far apart in separate clusters .
iteratively the time series clustering algorithm relocate the data points one step at a time to ensure that the data points inside the same cluster have the minimum intradissimilarity and data points across different clusters have the maximum inter - similarity .
the similarity is defined as the multidimensional distance between two data points whose multiple attributes are measured as how close they are in values .
two variables exist for time series clustering algorithm , one is for choosing the similarity function for measuring the distance between each pair of data points , and the other is the overall operation that converge from an initial assignment of data points to clusters to a converged or optimal assignment of data points to clusters .
many similarity measures are available such as manhattan , euclidean and minkowski just to name a few . in our experiments , a range of popular similarity functions are compared in performance in order to observe which one performs the best .  
table 2 shows a list of performance results in the percentage of correctly clustered groups by using various similarity functions .
because the nature of the data points that we are working with is time series , we choose to use dynamic time warping function ( dtw ) as a distance measure that finds optimal alignment between two sequences of time series data points .
dtw a pairwise comparison of the feature ( or attribute ) vectors in each time series .
it finds an optimal match between two sequences that allows for stretched or compressed sections of the sequences . in other words
it allows some flexibility for matching two sequences that may vary slightly in speed or time .
the sequences are  warped  nonlinearly in the time dimension to determine a measure of their similarity independent of certain nonlinear variations in the time dimension .
it is popular in the application of signal processing where two signal patterns are to be matched in similarity .
particularly suitable dtw is for matching sequences that may have missing information or various lengths , on condition that the sequences are long enough for matching . in theory ,
dtw is most suitable for voice wave patterns because exact matching for such patterns often may not occur , and voice wave patterns may vary slightly in time domain .
they range from simple ones like k - means and k - medoids , to sophisticated algorithms like dbscan , density - based clustering for clustering structures . in our case ,
hierarchical clustering is desirable because it allows the time series which are voice waves to be grouped in different levels automatically that helps a user to explore the structure of the groupings from coarse to refined .
like most of the clustering algorithms which operate by unsupervised learning , hierarchical clustering does not require the number of clusters to be predefined at the beginning ; it allows the data to decide the suitable number of groups by themselves . in our experiment , agglomerative mode which is also known as the  bottom up  approach is used .
initially each observation starts in its own cluster , and pairs of clusters are merged as one moves up the hierarchy . for deciding which clusters should be merged , a similarity function is used between sets of observations .
a variety of similarity functions are used here for experiments , they are canberra , dtw , euclidean , manhattan , and minkowski from power 1 to 10 .
the clustering algorithm constructs the hierarchy from the individual time series by progressively merging clusters up .
the basic process of hierarchical clustering comprises of the following steps , given n time series , and a two dimensional n  n similarity matrix s. 
 step 1each time series is assigned to a cluster of its own , with a total of n clusters for n time series .
initialize s with similarity measures between the clusters which are the same as the similarity measure between the time series that they contain . 
 
each time series is assigned to a cluster of its own , with a total of n clusters for n time series .
initialize s with similarity measures between the clusters which are the same as the similarity measure between the time series that they contain . 

retain the current level of clusters and move up a level in the hierarchy . 
 
retain the current level of clusters and move up a level in the hierarchy . 

step 3calculate the new similarity measures in s between the new clusters and each of the old clusters . 
 
calculate the new similarity measures in s between the new clusters and each of the old clusters . 

step 4finally repeat step 2 and step 3 until all the time series are clustered into a single cluster of size n. when this happens , the highest level of the hierarchy is attained . 
  finally repeat step 2 and step 3 until all the time series are clustered into a single cluster of size n. when this happens , the highest level of the hierarchy is attained .
two experiments are conducted for testing the performance of the algorithm over a synthetic control dataset   and a live dataset .
the synthetic control dataset contains 600 examples of time series wave forms synthetically generated by the process in alcock and manolopoulos ( 1999 ) .
there are six different classes of control charts that represent generally different shapes of time series waves
. each wave is characterized by 60 coefficients in the form of temporal data points , each different group ( or class ) has 100 samples and total there are 600 samples in the dataset .
each class has an essentially unique bunch of waveforms that are different from those of the other classes ; hence , we can assume the six classes represent six different types of speakers who have different voiceprints from one another .
for example , it could be speakers who come from six different geographical locations therefore different ascents , speakers who speak in six different emotions / languages , or speakers of six distinctively different age groups .
the other empirical dataset contains 640 time series of 12 linear prediction cepstrum coefficients ( lpcs ) taken from nine male speakers .
the data was initially collected by a japanese research team for examining a newly developed classifier for multidimensional curves ( multidimensional time series ) .
a 12-degree linear prediction analysis was applied to obtain a discrete - time series with 12 lpc cepstrum coefficients .
this means that one utterance by a speaker forms a time series whose length is in the range 729 , and each point of a time series is of 12 features ( 12 coefficients ) .
analysis parameters are as follows : sampling rate = 10  khz , frame length = 25.6  ms , and shift length = 6.4  ms .
blocks 130 represent speaker 1 , blocks 3160 represent speaker 2 , and so on up to speaker 9 .
a sample of the time series taken from one of the voice trace is shown in figure 4 .
just as shown in our model in figure 3 , the raw voice series are formatted and processed into records that have exactly 12 coefficients ( attributes ) .
hierarchical time series clustering is applied over the processed data , so that each data point that the clustering algorithm works with has identical attributes and scales for similarities measures . by plotting the processed data with x - axis as the first column of a consecutive block against the rest of the series with values within the range at the y - axis , we generate some visualization of the time series points with distinguishable shapes .   figure 5 shows three groups of voice series that are taken from the dataset blocks from three different speakers . just by visual inspection
the four voice utterances on the top row sit at about three quarters on the x - axis , the cap of the data clusters is dominated by small square dots ( that just represent one of the coefficient values of the block of the sample ) , then followed by other shapes of dots and diamond shaped dots at the bottom . though each of the four clusters on the top row is not exactly identical to each other , they roughly have a similar structure . in the middle row , the voice visualization by another speaker has the data near the middle of x - axis , and the outlined structure has the cross - shaped markers on the cap .
and the visualization on the bottom row has an obviously different formation than the other two .
that shows the voices of the three speakers are essentially different as by their voice characteristics , and the differences can be visually spotted .
however , computationally , the differences in voice characteristics would have to be revealed by clustering algorithm .
the hierarchical clustering algorithm that we applied in the experiment is implemented in r which is a free software environment for statistical computing and graphics ( http://www.r-project.org/ ) .
the synthetic data are first sampled with a ratio of 10% for producing the first iteration of data points and clusters .
dtw that serves as the similarity function is embedded in the clustering algorithm for processing the time series data till convergence .
a snapshot of the resulting dendrogram by using dtw similarity function is shown in figure 6(a ) .
it can be seen that the dendrogram by dtw can effectively partition the time series into six distinct groups that represent six speech types .
the groupings , by the dtw dendrogram as shown in figure 6(b ) , can be used to map over to the actual row number of the dataset that has a total of 600 rows . in other words ,
the time series that are indexed by the row numbers can be allocated to the six groups by the dendrogram as a result of time series clustering . in another counter example
, similarity function by euclidean distance is applied in the experiment ; we can easily see that the groupings at the dendrogram as shown in figure 7(a ) are not in perfect order at all .
we can safely remark that dtw is superior to euclidean in the clustering . from a bird - eye view
, figure 8 shows clearly on the efficacy of the two similarity functions in hierarchical time series clustering .
without showing the dendrogram for each of the other varieties of similarity functions , a comparison table below shows the performance of grouping of each technique .
the performance is estimated by counting the number of mislocated groups in the dendrogram by that particular similarity function .
dtw performs consistently well , while minkowski shows an optima when the power was increasing from 1 to 10 .
this observation confirms that dtw is suitable for time series clustering as time series do vary in time domain more or less to certain extent .
the subsequent experiment is to build a decision tree after the grouping has been formed by hierarchical time series clustering .
ripper function is suggested to be run for generated comprehensible rules that are in the form of if - then - else .
the rules specify a sequence of conditions meeting which in order lead to a predefined class label .
when a new voiceprint is received , pass it over the rules by checking its coefficient values that can determine which class label the voiceprint fits in .
the other decision tree algorithm is the classical c5.0 or j48 with pruning mode on , in weka which is an open source of machine learning algorithms for solving data mining problems implemented in java and open sourced under the gpl ( http://archive.ics.uci.edu/ml ) .
the time series data , however , are converted to their corresponding frequency domain by discrete wavelet transformation ( dwt ) .
dwt applies the the haar wavelet transform which was invented by kristian sandberg from university of colorado at boulder , usa in year 2000 .
dwt in principle works better than time series points in classification because dwt can find where the energies are concentrated in the frequency domain , and remarkable coefficients called haar attributes are well describing the characteristics of the time series .
a comparison of the original coefficients in time domain and transformed coefficient in frequency domain can be seen that wavelets after the transformation have sharper and narrower statistical distribution than the time series points , in figure 9 .
dwt is implemented in the plug - in filter in weka called  weka.filters.unsupervised.attribute.wavelet . 
the performance of the decision tree which is a voice classifier is defined as a composite of accuracy measures .
they generally come in the following indices in data mining as ( 1 ) the percentage of correctly classified instances , ( 2 ) the root relative squared error , ( 3 ) coverage of cases , ( 4 ) overall precision ; in a classification task , the precision for a class is the number of true positives ( i.e. , the number of items correctly labeled as belonging to the positive class ) divided by the total number of elements labeled as belonging to the positive class ( i.e. , the sum of true positives and false positives , which are items incorrectly labeled as belonging to the class ) , ( 5 ) overall recall which is defined as the number of true positives divided by the total number of elements that actually belong to the positive class ( i.e. , the sum of true positives and false negatives , which are items which were not labeled as belonging to the positive class but should have been ) , and ( 6 ) f - score , which is a measure of a test 's accuracy by considering both the precision and the recall of the test to compute the score . the performance comparison table is given in table 3 .
it compares mainly the classification accuracy by using a j48 decision tree in weka of the time series version and the wavelet version of the two testing datasets .
it can be noticed that in general wavelets have improvement over the time series in terms of classification accuracy .
the results of the empirical data are generally lower in accuracy than the synthetic control data probably due to its complex and less uniform in the time series structures , plus the normalization effect for limiting the time series into fixed length from its original variable length .
a sample of the decision tree generated from the experiment is shown in figure 10 . by using the decision tree as classifier
using voice as a biometrics has its advantage because it is a noninvasive nature process in human interaction , and human voice has been proven to contain biological traits that can uniquely identify an individual . in the past
many studies have focused on applying voice biometrics into security - related applications such as user verification and biometric identification .
voice classification is recently becoming popular as it serves as the underlying technique for monitoring different types of speakers and providing supreme customer service by estimating the natures of phone / web calls ; these applications potentially have high values in security surveillance and commercial uses . in this paper , a set of relatively simple and transparent techniques are described for enabling voice classification .
fellow researchers are encouraged to test out the collection of algorithms as recommended in this paper for experimenting voice datasets pertaining to voice classification applications .
in particular , we showed via experiments that hierarchical time series clustering algorithm with various similarity functions can yield different levels of accuracy .
it is shown possible that time series can be grouped into different clusters , just as if some unknown voices are grouped together by their common characteristics .
wavelets after transforming of time series samples into frequency domain demonstrate an improved accuracy performance in decision tree .
the future works include fine - tuning the mentioned algorithms in the paper for even better performance .
the algorithms should be programmed into a single software program in order to support as a core classification engine for voice biometric application systems .
 voice biometrics has a long history in biosecurity applications such as verification and identification based on characteristics of the human voice . 
 the other application called voice classification which has its important role in grouping unlabelled voice samples , however , has not been widely studied in research . lately 
 voice classification is found useful in phone monitoring , classifying speakers ' gender , ethnicity and emotion states , and so forth . in this paper , a collection of computational algorithms 
 are proposed to support voice classification ; the algorithms are a combination of hierarchical clustering , dynamic time wrap transform , discrete wavelet transform , and decision tree . 
 the proposed algorithms are relatively more transparent and interpretable than the existing ones , though many techniques such as artificial neural networks , support vector machine , and hidden markov model ( which inherently function like a black box ) have been applied for voice verification and voice identification . 
 two datasets , one that is generated synthetically and the other one empirically collected from past voice recognition experiment , are used to verify and demonstrate the effectiveness of our proposed voice classification algorithm . 
1. Introduction
2. Our Proposed Model
3. Design of the Hierarchical Time Series Clustering Algorithm
4. Experiments
5. Conclusion