BACKGROUND
protein-protein interactions  play a key role in many essential biological processes in cells, including signal transduction, transport, cellular motion and gene regulation.
the comprehensive analysis of these biological interactions has been regarded as very significant for the understanding of underlying mechanisms involved in cellular processes.
computational approaches for the prediction of ppi based on atomic level interactions can accurately determine the binding affinity and the specificity of binding partners.
thus, structure based prediction methods including modeling of ppi by homology modeling, threading-based methods and protein-protein docking are more accurate than methods that do not employ structure data.
a major drawback of these structure-based methods is the relatively low coverage of available crystallized protein complexes in the protein data bank   <cit> .
this is especially the case for those proteins associated with transient interactions, which is the majority of functional ppis, and these do not form complexes stable enough for x-ray crystallography  <cit> .
due to these restrictions the detailed analysis of the structure of protein complexes, specifically the area related to the interaction site between proteins, can reveal important clues for the understanding of protein functions and also characterize the specificity of these interaction regions.
the prediction of protein interaction sites has gained much attention in recent years with over  <dig> different methods proposed  <cit> .
interaction regions can be characterized by a diverse set of physico-chemical properties  <cit> , topological properties  <cit>  and conserved residues  <cit> .
a variety of studies have employed different classification approaches including support vector machines  <cit> , random forests  <cit>  and neural networks  <cit> .
these studies have shown that the interfaces of interaction sites share common properties that distinguish them from the rest of the protein  <cit> .
despite their good performance in the prediction of protein interaction sites, these machine learning approaches generate final prediction models which do not provide users with explicit rules and thus result in low interpretability of the results and poor knowledge extraction capability.
the identification, analysis and characterization of different ppi types can be classified according to their life time and binding affinity into four main classes  <cit> : obligate permanent interactions involving homo or hetero obligomers and non-obligate transient interactions involving enzyme-inhibitor or non enzyme-inhibitor.
in obligate protein interactions, protomers which are not individually structurally stable in vivo, form permanent functional complexes that are stable and exist in their complexed form.
protomers of non-obligate interactions are independently stable and can form transient or permanent complexes.
non enzyme-inhibitors are participants in transient interactions not involving enzymes and their protein inhibitors.
the characterization of ppi types can help for instance in the functional annotation of newly crystallized protein complexes as suggested in  <cit> .
several studies have been developed in this direction, focused on the discrimination of different ppi types with the aim of characterizing transient and obligate protein complexes  <cit> .
these include the statistical analysis of the interface properties  <cit> , and the analysis from an evolutionary view of issues related to these interactions  <cit> .
a recent computational approach  <cit>  classified binary protein complexes into three categories  using six interface properties and employing support vector machines .
these studies  <cit>  have improved our overall understanding of the differences between obligatory and non-obligatory or between permanent and transient interactions.
their analysis methods based on correlation drawn by the 2ds plot of two properties has shown that a single property does not completely distinguish the different ppi types of interaction sites and the combination of more properties can give more strength to the discrimination of ppi types.
in our work we describe a computational approach for the prediction of ppi types employing association rule based classification   <cit> , which includes association rule generation and posterior classification based on the discovered rules.
in a similar manner to previous approaches we investigate diverse properties associated with the interface of protein complexes.
but instead of considering the entire interface area between two proteins we only consider the region associated with domain information by using the scop classification  <cit> .
the use of domain profile pairs can provide better prediction of protein interactions than the use of full-length protein sequences as reported in wojcik et al.
<cit> .
in addition we also incorporate secondary structure information related to these domain-binding sites into our predictive approach.
these features appear to be useful for the characterization and classification of binding interfaces as reported recently in guharoy et al.
<cit> .
the main aim of this work is to discover patterns, in the form of association rules, that characterize interaction sites in different ppi types.
an important advantage of using such a classification approach is the interpretability of the final predictive model based on the analysis of the discovered set of rules.
we give a detailed interpretation of discovered association rules in order to find common and specific patterns which are biologically significant and can be used to distinguish one ppi type from others.
here we focus on the prediction of four different ppi types , trying to gain more specific insights into the characterization of diverse kinds of interactions.
methods
interaction data
we employed the same data set of non-redundant interacting protein complexes reported by  <cit> .
the set of  <dig> complexes was selected from a comprehensive set of  <dig> proteins taken from the pdb.
<dig> of these  <dig> complexes are involved in enzyme-inhibitor  interactions,  <dig> in non-enzyme-inhibitor  interactions,  <dig> in hetero-obligate  interaction, and  <dig> in homo-obligate  interactions as shown in table  <dig>  proteins sharing > 20% sequence identity with a higher resolution structure of the same complex type were removed.
crystal packing structures were also eliminated by investigating the evidence in the literature that the complex occurs naturally and is stable as a dimer.
nmr structures were not used, neither were mutant complexes nor structures whose resolution was >  <dig>  Å; permanent complexes are more easily available from stable complexes by x-ray crystallography.
transient ppis often neither form stable complexes nor give good nmr structures.
this is reflected in the small number of validated transient complexes available in the pdb.
aen z: enzyme-inhibitor interactions;
bnonenz: non-enzyme-inhibitor interactions;
chet: hetero-obligate interactions;
dhom: homo-obligate interactions.
definition of interface and dom-face
an interface is a set of interacting atoms whose solvent accessible surface area  is decreased by >  <dig> Å <dig> upon the formation of a complex  <cit> .
the sasa for each atom was calculated using msms  <cit>  with a probe sphere of radius  <dig>  Å. given a pair of interacting proteins, we define a set of interacting atoms for a single protomer as a face.
an interface comprises a pair of interacting faces.
we define the set of atoms comprising the face of a single domain as a dom-face.
in order to calculate dom-faces, the interfaces extracted from complexes are mapped onto ranges of scop  <dig>  domain definitions  <cit> .
a total of  <dig> scop domains were extracted related to form the  <dig> protein complexes considered in our study of the different ppi types, see table  <dig>
description of dom-face
we generated  <dig> different physico-chemical properties and structural features to characterize each of the dom-faces considered in our study including: dom-face area , hydrophobicity , residue propensity , number of amino acids , number of atoms , number of secondary structure elements , length of consecutive residues , number of fragments , size ratio of dom-face area to domain area , secondary structure elements  content  and scop class number .
hydrophobicity and residue propensity were analyzed in the same way as jones and thornton  <cit> .
the solvent accessible surface area  of a dom-face is calculated as the sum of the total decreased sasa for the interface atoms in a domain, see equation  <dig>  if a and b are two protomers in the complex ab, sasaa, sasab and sasaab are sasa values for a, b, and ab respectively, and n is the total number of interface atoms in a domain presented in protomers a and b, then
dom-face area=,sasab),−sasaab)
we employed the hydrophobicity scale of fauchere and pliska  <cit>  to estimate the average hydrophobicity value for each dom-face.
the average hydrophobicity  is calculated using equation  <dig>  where hiaa is the hydrophobicity value for each amino acid residue and naa is the number of residues in a dom-face.
hh=∑i=1lhiaanaa
residue propensity  indicates the relative frequency of different amino acid  residues in dom-faces of complexes.
we estimated residue propensities for all dom-faces using equation  <dig>  <cit> , where aapi in supplementary table one  is the natural logarithm of each aa propensity and nr is the total number of residues in a dom-face.
aa propensities for  <dig> amino acids over our data sets of  <dig> dom-faces were calculated using supplementary equation one .
inpro=∑i=1naapinr
in order to analyze the size of interaction sites we computed the ratio between dom-face and the whole domain area  employing equation  <dig>
sr=asadom-faceasadomain
the sequence continuity in the interaction sites is described by calculating average length  of consecutive residues  and counting the number of consecutive residues  in dom-faces.
the sse content is calculated by the percentages of interaction atoms located in secondary structure elements , classified using the types defined in dssp  <cit> : helix, strand and non regular regions .
ppi types become the heads of association rules in arm and the target classes in our classification.
we used four different types of ppi, namely enzyme inhibitor/non enzyme inhibitor as transient interaction types and homo/hetero obligomers as permanent interaction types.
other properties estimated for the diverse dom-faces analyzed were the scop class number at the first level of the scop hierarchy, the number of aa, the number of atoms and the number of sses present in the different interaction interfaces.
association rule based classification
the problem of predicting ppi types for a given complex of binary proteins is transformed into the task of assigning a pre-determined target class  using properties of interaction sites.
we applied an efficient association rules based classification method  to perform classification based on rules generated by association rule mining .
previous studies  <cit>  have proposed that arbc consistently outperforms other rule-based classifiers such as decision trees.
arbc comprises three main steps: association rule generation, pruning association rules and classification based on association rules.
association rule generation
in our approach we employed association rule mining to discover a set of frequent patterns expressed as association rules describing the relationship between properties of ppi interaction sites and ppi types.
association rules have the form r: x → y , where x and y are the body and the head of the rule respectively.
x and y are disjoint predicates .
each x and y consists of a conjunction of distinct predicates which describe properties related to interaction sites.
note that we can consider a conjunction as a set for our purposes.
in our approach, the heads of all rules y are restricted to be one of the ppi types considered which are the target classes defined in this task.
the strength of the association rules can be measured in terms of their support  and confidence .
the support of a rule  is the probability that the cases in a database contain both x and y. the confidence of the rule is the probability that a case contains y given that it contains x.
the generation of association rules was carried out employing the apriori algorithm  <cit> .
we used the  <dig> g oracle data miner  software which implements the apriori algorithm to compute the type of association rules required for our arbc approach.
we set a minimum support and confidence of 3% and 25% respectively to reduce the number of association rules generated.
association mining is not directly applicable to real valued continuous data such as some of the dom-face properties we generated.
hence we used discretisation to manipulate continuous attributes before the arm process was executed.
in this process adjacent values of continuous data were binned into a finite number of intervals.
pruning association rules
the number of rules generated by arm can be very large.
it is necessary to prune the set of association rules by removing redundant information in order to make the classification more efficient.
given two rules r1: x <dig> → y <dig> and r2: x <dig> → y <dig>  we define:
definition  <dig>  the significance of a rule: r <dig> is more significant than r <dig> if and only if either  conf  > conf  or  conf  = conf  but sup > sup or  r <dig> has fewer attributes in its left hand side than r <dig> ◇
definition  <dig>  general rule: given two rules r1: x <dig> → y <dig> and r2: x <dig> → y <dig>  r <dig> is a general rule if and only if x <dig> ⊆ x <dig> ◇
definition  <dig>  overlapping rule: given two rules r1: x <dig> → y <dig> and r2: x <dig> → y <dig>  then r3: x <dig> ∨ x <dig> → y <dig>  sup) ∨ y <dig>  sup) is an overlapping rule if and only if x <dig> = x <dig> and y <dig> ≠ y2
◇ if the body of a rule r <dig> is identical to the body of a rule r <dig> and the head of rule r <dig> is inconsistent with that of rule r <dig>  then an overlapping rule r <dig> between two different ppi types can be identified.
overlapping rules can be considered as common rules between two or more ppi types.
on the other hand unique rules are distinctive patterns which can be used to classify interaction sites into different ppi types.
we then evaluated the following condition in order to prune the set of association rules previously generated.
given two rules r <dig> and r <dig>  where r <dig> is a general rule w.r.t.
r <dig>  arbc eliminate r <dig> if r <dig> has more significance than r <dig>  sets of unique and overlapping rules were generated with the pruning procedure used in the classification.
classification
in the classification step we employed the pruned set of unique and overlapping rules to generate a rule profile consisting of an m × n matrix, where m is the number of examples  and n is the number of different association rules obtained after the pruning step.
each row of this matrix represents one of the dom-faces considered in our research and is associated with one of the ppi types we wish to classify.
the rule profile matrix takes values of  <dig> or  <dig> depending whether the different rules are contingent or not on the respective dom-face example.
a similar approach was previously employed in  <cit>  for protein structure comparison.
the rule profile matrix was generated following algorithm  <dig> and then used as input to the arbc process.
algorithm  <dig> generation of a rule profile
input:   a set of rules  and
a set of training data comprising m objects
output:   an m × n matrix, rprofile
method:
<dig>             sort rules in the descending order of confidence and support
<dig>             for each rule rj in the descending order of the rules
for each data object oi in the training data
find match between oi and rule rj
if match
set rprofile = 1
else
set rprofile = 0
end-for
end-for
we evaluated several classification techniques for this task including decision trees , random forest , k nearest neighbor , support vector machines , and naive bayes .
the weka machine learning library  <cit>  was used to perform these experiments.
we also performed conventional classification based only on the physicochemical properties of the different dom-faces examples, without generating a set of association rules .
this was done in order to evaluate if the employment of the arbc approach could be associated with a loss of information of some interacting complexes due, for example, to the pruning step or the discretisation of continuous value feature information.
in all cases a  <dig> fold cross validation procedure was performed.
because the task of classification of different ppi types involves imbalanced classes  we utilized an over-sampling strategy, incrementing the number of instances associated with those ppi types with few examples.
RESULTS
analysis of dom-face properties
we found that  <dig> % of the interaction sites studied are contained within corresponding ranges of scop domains.
this suggests that the analysis of interaction sites based on structural domains  does not lose interaction information.
average values of diverse dom-face properties for different ppi types are shown in table  <dig>  the distribution of df-asa for different types is presented in supplementary figure one .
it is possible to observe a distinct difference in the distribution of non-obligate  and obligate  complexes.
the distribution patterns of dom-face area for enz are similar to those of nonenz and the same trend occurs between het and hom.
in the distribution of the area of interaction sites, obligate ppi types exhibit a greater variance and in general tend to have larger interaction sites than non-obligate complexes.
the average hydrophobicity  values for enz, nonenz, het and hom are respectively  <dig> ,  <dig> ,  <dig> , and  <dig> .
even though average hh values are similar for different ppi types, the histogram distributions of hydrophobicity  exhibit distinctive separation patterns between non-obligate and obligate interactions.
the distribution of hh for enz is similar to nonenz and that of het is similar to hom.
we note that arg, his, tyr, gln and trp exhibit higher propensities than other amino acids, while gly has a low propensity in our analysis.
average residue propensities are shown in table  <dig>  het has the highest residue propensity and hom the lowest.
we also analyzed the top four frequent residues for each interaction type calculating the sum of asa for each amino acid .
hydrophobic residues including leu, ala, and val frequently occur in types het and hom.
the charged residue glu also appears frequently in het.
in nonenz, charged residues including asp, glu, lys, and arg are present in the top four frequent residues.
enz includes not only some polar residues ser and tyr but also the charged residue glu.
we observed that the charged residues occur very frequently in all interaction types and appear dominantly in het.
trp, cys, and met rarely occurred in interface area through all types.
the average values of the size ratio between dom-face area and domain area for enz, nonenz, het, and hom are  <dig> ,  <dig> ,  <dig> , and  <dig>  respectively as shown in table  <dig>  the distribution of size ratio is shown in supplementary figure four .
we observed that 92% of dom-faces are smaller than a half of their domain sizes based on the calculation of asa values.
the average length of consecutive residues  are  <dig> ,  <dig> ,  <dig>  and  <dig>  for enz, nonenz, het, and hom respectively as shown in table  <dig>
the average distribution of sse elements  for different ppi types is shown in figure  <dig>  we have seen that interaction sites are mostly composed of non-regular regions followed by helix and strand regions.
enz contains  <dig> % of non-regular regions, which is the highest percentage.
helix content are greater than 36% in types nonenz, het and hom but are less than 17% in enz.
strand content for all types are less than 20% and het exhibits the lowest value .
the variation in the number of amino acids  is similar to that for the number of atoms .
average values for natom, naa, nsse and nfrag are shown in table  <dig>  we found that values for types het and hom are higher than for types enz and nonenz in all these categories.
the distribution of these properties  for enz is similar to nonenz.
classification of ppi types
we were able to discover a total of  <dig>  rules describing associations by employing arm.
after the pruning stage a total of  <dig> association rules  were selected for the classification process.
the number of rules associated with types enz, nonenz, het and hom are  <dig>   <dig>   <dig>  and  <dig> respectively .
a total of  <dig> of these are unique, i.e.
rules exclusively associated with just one ppi type.
the remaining  <dig> rules are overlapping  rules related to two or more ppi types.
we are interested in this distinction because unique rules appear to be related to specific characteristics of ppi types, whilst overlapping rules can be related to common attributes of different interaction types or for instance to distinctive properties between obligate and non-obligate interactions.
a#.
of domains: a number of domains in each ppi type;
b#.
of rules: a number of association rules discovered for each ppi type;
cunique rules: a number of association rules associated with just one ppi type;
doverlapping rules: a number of rules of which bodies are identical to those of rules in other types.
the performance for different classification methods measured as total accuracy over  <dig> fold cross validation for arbc is shown in table  <dig>  additionally we performed classification based on the physicochemical properties of the different dom-faces, and also arbc classification based on a rule profile generated using only the set of  <dig> unique rules discovered .
performance results for these approaches are also given in table  <dig>  we have seen that in all these cases svm exhibited the best performance among diverse classifiers studied, reaching over 99% accuracy in some cases.
however this high accuracy suggests that overfitting problems are associated with the use of svm.
the other classification approaches evaluated still exhibit a high accuracy with the exception of nb.
the performance reached by them is comparable to that previously reported in  <cit>  although not exactly the same instances and features were employed.
additionally we observed that there was no significant appreciable difference between the performance of arbc and cwar in most of the situations, although it seems that cwar performed slightly better than arbc.
amethod represents different classification methods such as decision tree , random forest , k nearest neighbor, support vector machine  and naive bayes ;
barbc: association rule based classification;
ccw ar: classification based on physicochemical properties;
dur: arbc classification using  <dig> unique association rules;
e, f, g: data sets with exclusion of sse content from all data1;
1all data: data sets including sse content;
2no sse data: data sets without inclusion of sse content.
these results strongly suggest that arbc performs competitively with conventional classification approaches for this task, and consequently the use of arbc does not involve an important loss of information derived from arm.
the performance of arbc using only unique rules clearly decreased for all classification methods evaluated, although maintaining an acceptable accuracy of near or over 90% in most of the cases.
this suggest that unique rules can be influential in classifying most of the ppi types considered in our study and that overlapping rules are important to improve the accuracy of the classification task.
it is important to emphasize that the aim of our research is focused on the advantage of interpretability of the discovered rules rather than the optimization of the classification task.
we further investigated the influence of sse information on the classification of ppi types.
we evaluated three different data sets without using the secondary structure elements of proteins, including arbc_wo_sse, cwar_wo_sse and ur_wo_sse.
each of the two rule profiles in this case contains a total of only  <dig> association rules and  <dig> unique rules.
results for these evaluations are also highlighted in table  <dig>  it was found that in all cases the performance of diverse classifiers tended to decrease when sse data was omitted, although only a slightly reduction is observed in most of the classifiers evaluated.
interestingly the major decrement in performance was observed when employing ur_wo_sse, with accuracies of less than 90% for all classifiers including svm.
these results strongly suggest that sse content in interaction sites could have an important role in the discrimination of different ppi types for both approaches including arbc and cwar.
this implies that the average confidences of the rule sets that include this sse content information may be higher than those without it.
there were  <dig> %  such rules that included sse content information and their average confidence was  <dig>  .
when we considered the top  <dig> rules that are covered by 20% of all the rules, their confidence was  <dig> .
among them, 42%  contained sse information with an average confidence of  <dig> .
the sse content rules were enriched among those rules exhibiting higher confidences.
the same trend was also seen with unique rules: while the average confidence of  <dig> unique rules was  <dig> , that of the  <dig> unique sse rules was  <dig> .
here we infer that sse content in interaction sites is a significant feature that permits reliable classification of the interaction types.
acon f1: average confidence of a rule subset;
bcon f2: average confidence of sse content rules in a rule subset;
csse: association rules encoding sse content;
dtopk: top k rules covering top 20% in confidence;
eunique: unique rules.
interpretation of discovered association rules
determination of important rules
to select a set of informative and discriminative rules for the extraction of knowledge, most of the existing approaches rank the association rules based on the confidence value of a individual rule.
a strong rule which is highly confident and represents general knowledge, may not be a good discriminative rule for the classification.
instead, a better measure of the importance of a rule should include the following factors considered together: correlation between a property and a class, the degree of classification power, confidence and support, top k coverage and uniqueness of a rule.
as noted in the previous section, the inclusion of the sse content information in our arbc approach has a positive effect on the classification accuracy .
the importance of a rule can be quantified by integrating the various factors including the sse content information.
we defined a importance factor  by an average value of all the factors.
in order to illustrate the informativeness of the rules in understanding interface features, some representative rules within the top 30%  of i are listed in table  <dig>  the list was complemented by some other rules ranked below  <dig> in order to explain overlapping rules and compare association rules to rules generated from a decision tree.
similarly, rules describing the enz type with varying different structural features are listed in table  <dig>  rules in tables  <dig> and  <dig> are sorted by type and i.
representative examples of  <dig> rules within top 30% are listed by sorting columns type and i. rules of which order is below  <dig> are added for explaining overlapping rules and the comparison to rules produced from a decision tree.
a#: rule identifier;
bo: order of a rule ranking by importance factor;
crule description: the body of a rule;
dtype: the head of a rule representing a ppi type;
econf: confidence of a rule;
f supp: support of a rule;
gc: rules selected from correlation-based feature subset selection  <cit> ;
hg: the worth of a rule by measuring the gain ratio  <cit> with respect to ppi types;
ik: top k rules ranked within top 30%;
ju: unique rules;
ks: sse content rules;
li: importance factor of a rule calculated by an average of all factors such as conf, supp, c, g, k, u and s; "-" is replaced with value  <dig> when the importance factor was calculated.
abbreviation of column names is the same as that of table  <dig>
the enz subtypes are defined in figure  <dig>  note that enz_b includes both inhibitors and enzymes while the others are exclusively formed by inhibitors  or enzymes .
we have shown that the interaction sites were dominated by non-regular region: especially for enz interactions, almost  <dig> of the sites in average were composed of non-helix and non-beta strand regions .
this is manifested in rules  <dig> ,  <dig>   <dig> and  <dig>  all of which require  <dig> – 80% content of non-regular regions to be classified as enz.
some of the rules containing negation predicates are strong indicators of certain interaction types.
for example, "nohelix " and "nostrand " in the interaction sites imply enz  and nonenz , respectively.
het is characterized by relatively small portions of strands  and "nostrand " .
it is also observed that rules containing such sse content information conjuncted with other properties  or combined with other rules ,  and 3) become stronger discriminators for classifying ppi types than rules containing only sse content information .
we note that some rules  containing sse information with scop classes are the most discriminative and informative in order to characterize enz and nonenz.
inference of subtypes
some rules which share the same sets of properties but differ in their value ranges or have other properties can be effective in order to compare features of different interaction types or to identify subtypes in a ppi type.
for example, among the top 30% rules, rules  <dig>  and  <dig>  describe types enz and nonenz respectively, using the same set of properties such as number of atoms and df-asa.
however, their values imply that the interaction sites of nonenz  are larger than those of enz .
the ranges of size scales of interaction sites in enz are presented in rules  <dig>   <dig> and  <dig>  that share the same set of properties but differ in their values.
the overall size of interaction sites in enz are described by rule  <dig> with the highest confidence among those rules encoding the size of interaction sites.
these are interesting cases where the structural difference between types can be directly inferred and subtypes of a ppi type can be derived by grouping different features of interaction sites.
we deduced five subtypes of enz and a hierarchical tree  to account for those subtypes.
we compiled a list of representative association rules  to show structural features different among these subtypes.
we note that interaction sites of enzymes are distinguished from those of inhibitors in enzyme-inhibitor complexes.
interaction sites for inhibitors are relatively small, i.e., mainly <  <dig> Å^ <dig> , and are made up of strands  and mostly non-regular regions  without helix content  which is very informative in order to characterize inhibitors.
remarkably rules  <dig> and  <dig> generalize common features of inhibitors with respect to the size of interaction sites and sse content.
as rule  <dig> was considered to be very discriminative to differentiate enz from other types, it can depict characteristics of a small group of inhibitors with indicating that inhibitors in scop class  <dig> do not contain helix in interaction sites ,  and 3).
in contrast, enzymes have larger interaction sites than their inhibitors and form mixtures of helices and strands in interaction sites .
both rules  <dig> and  <dig> show that enzymes  have sses twice as many as inhibitors .
this indicates that both enzymes and inhibitors may contain mainly strands as regular sses in interaction sites since enzymes are included in scop class  <dig>  and inhibitors do not contain helices in interaction sites.
this suggests that non regular regions and beta strands are mainly involved in the interfaces of enzyme-inhibitor interactions.
such extracted information can be useful for the prediction of interaction sites for enzyme-inhibitor complexes.
this observation is demonstrated by some small inhibitors in type enz_a  and type enz_b .
those inhibitors interact with enzymes in type enz_b.
the enzymes described by rules  <dig>   <dig> and  <dig> are included in scop superfamily trypsin-like serine proteases  and the inhibitors are mainly in scop class  <dig> which is composed of small proteins dominated by metal ligand, heme, and disulfide bridges.
it is possible in a similar way to infer subtypes of other ppi types.
among ppi types, enz has plenty of rules  to derive subtypes.
hence, the comparative analysis of association rules was presented for enz.
comparison of association rules to part rules
to improve our understanding of the association rules discovered, we compared part rules produced from a decision tree built using c <dig>  over our properties with the association rules.
there were a total of  <dig> part rules generated and their average confidence and support were  <dig>  and  <dig>  respectively.
we have collected a representative list of part rules in table  <dig>  in the comparison of the association rules with part rules, part rules are more complicated with the composition of more predicates in rule bodies than those in association rules.
typically, one part rule corresponds to more than  <dig> ~ <dig> association rules .
both rules provided quantitative descriptions.
however, property values in part rules represent split points for classification and are not represented by intervals of quantitative values.
some part rules  including identical properties with different split points in the same rule bodies were not clear enough to determine decision boundaries of properties.
these limit the readability and understandability of part rules whilst the association rules were simple enough to be interpreted by users.
it was also possible with association rules to support the comparative analysis of rules between different ppi types as we inferred the possibility of subtypes and relative information by comparison of size scales of interaction sites in enz.
a set of association rules discovered by arm comprises mostly weak rules together with a small number of strong rules.
on the contrary, most part rules consist of a number of very strong rules which have the highest confidences and low supports.
a: a total of  <dig> rules produced by a decision tree using c <dig>  algorithm in weka machine learning library;
b#: part rule identifier;
ccorresponding rules: association rule identifiers  corresponding to a part rule.
one of the most notable differences between association rules and part rules is in how to handle overlapping rules between different types.
if two different interaction types are predicted from the identical head of a rule, these are called overlapping rules.
there were  <dig> such cases out of a total of  <dig> rules .
their distribution is illustrated in supplementary figure nine .
table  <dig> shows representative examples of overlapping rules.
examination of the overlapping rules shared by enz and nonenz indicated that these types are similar in terms of df-asa, natom, and naa  differentiated by combination with the rest of properties such as sse content, average length of consecutive residues, size ratio, and hydrophobicity.
part rules are unique cross ppi types.
examples of overlapping rule are selected from tables  <dig> and  <dig>
a# rule identifier;
b#: rule identifier in tables  <dig> and 7;
rule descriptionc: the body of overlapping rules between the two types;
dtypes: ppi type <dig> and type <dig> having overlapping rules in common;
e, gcon f: confidences of overlapping rules for type <dig> and type <dig> respectively;
f, hsupp: supports of overlapping rules for type <dig> and type <dig> respectively.
CONCLUSIONS
we have developed a classification method that categorizes each ppi into one of four different types using association rule based classification .
the application of association rule mining over  <dig> known ppi domains using  <dig> properties yielded a total of  <dig> rules, which in turn discriminated the features of interaction sites for different ppi types and were used to generate a classification model to predict ppi types.
our arbc approach performed competitively compared with conventional methods applied directly to the property values: for example, the work in  <cit>  reported an accuracy of  <dig> % for the classification of three types of interactions by directly applying svm.
although it is not possible to make a direct comparison of their method with ours due to heterogeneity of the data set, this suggests that the processes of association rule generation and subsequent pruning do not incur a loss of relevant information.
at the same time, our results demonstrated that we were able to considerably improve the accuracy of the prediction of ppi types through the use of structural domain information for the description of interaction interfaces, and also the use of secondary structure content.
although sse content alone could not classify interaction sites with high accuracy, its incorporation with other properties improved the accuracy of classification.
our approach based on arbc has a clear advantage over conventional methods because results are reported in terms of rules that are a quantitative description of properties and hence their interpretation is straightforward and simple.
thus, biologists can easily judge if a discovered rule is interesting or not.
analysis of common and unique properties together is a unique feature of our approach, unlike conventional classification methods which typically capture unique properties only.
common rules capture those properties which are common between ppi types.
in particular enzyme inhibitor  and non-enzyme inhibitor  interactions, both being non-obligate or transient, share more properties in common than with other types.
as we have demonstrated, all these features produce descriptive rules, enabling their simple and powerful interpretation.
we observed that the property distributions of homo-obligate interactions are similar to those of hetero-obligate interactions but distinct from those of non-obligate interactions.
we found that obligate interactions have larger and more hydrophobic interaction sites than non-obligate interactions.
hydrophobic residues including leu, ala, and val were found more frequently in obligate interactions whilst polar residues including ser and gly were present in non-obligate interactions.
charged residues  were seen frequently in all interaction types.
on the basis of a detailed analysis of association rules, it was observed that interactions between enzymes and their inhibitors were separated into several different structural subgroups.
this may lead to the possibility of different subtypes of ppis being involved in transient interactions.
our findings based on the interpretation of association rules are consistent with the description of obligate complexes in previous studies  <cit> .
in future work we plan to improve our approach by incorporating additional properties such as energy functions and electric potentials for the generation of more accurate and meaningful association rules.
the unique contribution of our work is the development of a novel methodology that analyzes specificities and commonalities for interaction types, and we intend to extend this to the prediction of interaction partner and interaction sites.
authors' contributions
shp developed the concept and the method under the supervision of drg.
jar carried out classification and participated in drafting the paper.
sk interpreted the results for the point of view of a biologist.
jwk developed the web application.
shp drafted the paper, jar, drg and sk finalized the draft.
all authors read and approved the final manuscript.
supplementary material
additional file 1
calculation of residue propensity.
a table shows aa propensity for  <dig> amino acids and a equation represents the calculation of residue propensity.
click here for file
additional file 2
association rules.
a set of association rules discovered for all types presents and rules are sorted by type and i.
click here for file
additional file 3
distribution of dom-face properties.
the figures represent the statistical distributions of dom-face properties for four ppi types.
click here for file
acknowledgements
we are grateful to dr k. r. lee at ssu for helpful discussions.
we thank dr. j. r. bradford and prof. d. r. westhead at university of leeds, h. neuvirth and g. schreiber at weizmann institute of science for providing their data sets.
shp was supported by the korea research foundation grant funded by the korean government.
jar has been supported by the programme alβan, the european union programme of high level scholarships for latin america, scholarship e04d034854cl.
sk was supported by soongsil university research fund.

 protein-protein interactions play a key role in many essential biological processes in cells, including signal transduction, transport, cellular motion and gene regulation. the comprehensive analysis of these biological interactions has been regarded as very significant for the understanding of underlying mechanisms involved in cellular processes. computational approaches for the prediction of ppi based on atomic level interactions can accurately determine the binding affinity and the specificity of binding partners. thus, structure based prediction methods including modeling of ppi by homology modeling, threading-based methods and protein-protein docking are more accurate than methods that do not employ structure data. a major drawback of these structure-based methods is the relatively low coverage of available crystallized protein complexes in the protein data bank. this is especially the case for those proteins associated with transient interactions, which is the majority of functional ppis, and these do not form complexes stable enough for x-ray crystallography. due to these restrictions the detailed analysis of the structure of protein complexes, specifically the area related to the interaction site between proteins, can reveal important clues for the understanding of protein functions and also characterize the specificity of these interaction regions. the prediction of protein interaction sites has gained much attention in recent years with over different methods proposed. interaction regions can be characterized by a diverse set of physico-chemical properties, topological properties and conserved residues. a variety of studies have employed different classification approaches including support vector machines, random forests and neural networks. these studies have shown that the interfaces of interaction sites share common properties that distinguish them from the rest of the protein. despite their good performance in the prediction of protein interaction sites, these machine learning approaches generate final prediction models which do not provide users with explicit rules and thus result in low interpretability of the results and poor knowledge extraction capability. the identification, analysis and characterization of different ppi types can be classified according to their life time and binding affinity into four main classes: obligate permanent interactions involving homo or hetero obligomers and non-obligate transient interactions involving enzyme-inhibitor or non enzyme-inhibitor. in obligate protein interactions, protomers which are not individually structurally stable in vivo, form permanent functional complexes that are stable and exist in their complexed form. protomers of non-obligate interactions are independently stable and can form transient or permanent complexes. non enzyme-inhibitors are participants in transient interactions not involving enzymes and their protein inhibitors. the characterization of ppi types can help for instance in the functional annotation of newly crystallized protein complexes as suggested in. several studies have been developed in this direction, focused on the discrimination of different ppi types with the aim of characterizing transient and obligate protein complexes. these include the statistical analysis of the interface properties, and the analysis from an evolutionary view of issues related to these interactions. a recent computational approach classified binary protein complexes into three categories using six interface properties and employing support vector machines. these studies have improved our overall understanding of the differences between obligatory and non-obligatory or between permanent and transient interactions. their analysis methods based on correlation drawn by the 2ds plot of two properties has shown that a single property does not completely distinguish the different ppi types of interaction sites and the combination of more properties can give more strength to the discrimination of ppi types. in our work we describe a computational approach for the prediction of ppi types employing association rule based classification, which includes association rule generation and posterior classification based on the discovered rules. in a similar manner to previous approaches we investigate diverse properties associated with the interface of protein complexes. but instead of considering the entire interface area between two proteins we only consider the region associated with domain information by using the scop classification. the use of domain profile pairs can provide better prediction of protein interactions than the use of full-length protein sequences as reported in wojcik et al.. in addition we also incorporate secondary structure information related to these domain-binding sites into our predictive approach. these features appear to be useful for the characterization and classification of binding interfaces as reported recently in guharoy et al.. the main aim of this work is to discover patterns, in the form of association rules, that characterize interaction sites in different ppi types. an important advantage of using such a classification approach is the interpretability of the final predictive model based on the analysis of the discovered set of rules. we give a detailed interpretation of discovered association rules in order to find common and specific patterns which are biologically significant and can be used to distinguish one ppi type from others. here we focus on the prediction of four different ppi types, trying to gain more specific insights into the characterization of diverse kinds of interactions. methods interaction data we employed the same data set of non-redundant interacting protein complexes reported by. the set of complexes was selected from a comprehensive set of proteins taken from the pdb. of these complexes are involved in enzyme-inhibitor interactions, in non-enzyme-inhibitor interactions, in hetero-obligate interaction, and in homo-obligate interactions as shown in table proteins sharing > 20% sequence identity with a higher resolution structure of the same complex type were removed. crystal packing structures were also eliminated by investigating the evidence in the literature that the complex occurs naturally and is stable as a dimer. nmr structures were not used, neither were mutant complexes nor structures whose resolution was > Å; permanent complexes are more easily available from stable complexes by x-ray crystallography. transient ppis often neither form stable complexes nor give good nmr structures. this is reflected in the small number of validated transient complexes available in the pdb. aen z: enzyme-inhibitor interactions; bnonenz: non-enzyme-inhibitor interactions; chet: hetero-obligate interactions; dhom: homo-obligate interactions. definition of interface and dom-face an interface is a set of interacting atoms whose solvent accessible surface area is decreased by > Å upon the formation of a complex. the sasa for each atom was calculated using msms with a probe sphere of radius Å. given a pair of interacting proteins, we define a set of interacting atoms for a single protomer as a face. an interface comprises a pair of interacting faces. we define the set of atoms comprising the face of a single domain as a dom-face. in order to calculate dom-faces, the interfaces extracted from complexes are mapped onto ranges of scop domain definitions. a total of scop domains were extracted related to form the protein complexes considered in our study of the different ppi types, see table description of dom-face we generated different physico-chemical properties and structural features to characterize each of the dom-faces considered in our study including: dom-face area, hydrophobicity, residue propensity, number of amino acids, number of atoms, number of secondary structure elements, length of consecutive residues, number of fragments, size ratio of dom-face area to domain area, secondary structure elements content and scop class number. hydrophobicity and residue propensity were analyzed in the same way as jones and thornton. the solvent accessible surface area of a dom-face is calculated as the sum of the total decreased sasa for the interface atoms in a domain, see equation if a and b are two protomers in the complex ab, sasaa, sasab and sasaab are sasa values for a, b, and ab respectively, and n is the total number of interface atoms in a domain presented in protomers a and b, then dom-face area=,sasab),−sasaab) we employed the hydrophobicity scale of fauchere and pliska to estimate the average hydrophobicity value for each dom-face. the average hydrophobicity is calculated using equation where hiaa is the hydrophobicity value for each amino acid residue and naa is the number of residues in a dom-face. hh=∑i=1lhiaanaa residue propensity indicates the relative frequency of different amino acid residues in dom-faces of complexes. we estimated residue propensities for all dom-faces using equation, where aapi in supplementary table one is the natural logarithm of each aa propensity and nr is the total number of residues in a dom-face. aa propensities for amino acids over our data sets of dom-faces were calculated using supplementary equation one. inpro=∑i=1naapinr in order to analyze the size of interaction sites we computed the ratio between dom-face and the whole domain area employing equation sr=asadom-faceasadomain the sequence continuity in the interaction sites is described by calculating average length of consecutive residues and counting the number of consecutive residues in dom-faces. the sse content is calculated by the percentages of interaction atoms located in secondary structure elements, classified using the types defined in dssp: helix, strand and non regular regions. ppi types become the heads of association rules in arm and the target classes in our classification. we used four different types of ppi, namely enzyme inhibitor/non enzyme inhibitor as transient interaction types and homo/hetero obligomers as permanent interaction types. other properties estimated for the diverse dom-faces analyzed were the scop class number at the first level of the scop hierarchy, the number of aa, the number of atoms and the number of sses present in the different interaction interfaces. association rule based classification the problem of predicting ppi types for a given complex of binary proteins is transformed into the task of assigning a pre-determined target class using properties of interaction sites. we applied an efficient association rules based classification method to perform classification based on rules generated by association rule mining. previous studies have proposed that arbc consistently outperforms other rule-based classifiers such as decision trees. arbc comprises three main steps: association rule generation, pruning association rules and classification based on association rules. association rule generation in our approach we employed association rule mining to discover a set of frequent patterns expressed as association rules describing the relationship between properties of ppi interaction sites and ppi types. association rules have the form r: x → y, where x and y are the body and the head of the rule respectively. x and y are disjoint predicates. each x and y consists of a conjunction of distinct predicates which describe properties related to interaction sites. note that we can consider a conjunction as a set for our purposes. in our approach, the heads of all rules y are restricted to be one of the ppi types considered which are the target classes defined in this task. the strength of the association rules can be measured in terms of their support and confidence. the support of a rule is the probability that the cases in a database contain both x and y. the confidence of the rule is the probability that a case contains y given that it contains x. the generation of association rules was carried out employing the apriori algorithm. we used the g oracle data miner software which implements the apriori algorithm to compute the type of association rules required for our arbc approach. we set a minimum support and confidence of 3% and 25% respectively to reduce the number of association rules generated. association mining is not directly applicable to real valued continuous data such as some of the dom-face properties we generated. hence we used discretisation to manipulate continuous attributes before the arm process was executed. in this process adjacent values of continuous data were binned into a finite number of intervals. pruning association rules the number of rules generated by arm can be very large. it is necessary to prune the set of association rules by removing redundant information in order to make the classification more efficient. given two rules r1: x → y and r2: x → y we define: definition the significance of a rule: r is more significant than r if and only if either conf > conf or conf = conf but sup > sup or r has fewer attributes in its left hand side than r ◇ definition general rule: given two rules r1: x → y and r2: x → y r is a general rule if and only if x ⊆ x ◇ definition overlapping rule: given two rules r1: x → y and r2: x → y then r3: x ∨ x → y sup) ∨ y sup) is an overlapping rule if and only if x = x and y ≠ y2 ◇ if the body of a rule r is identical to the body of a rule r and the head of rule r is inconsistent with that of rule r then an overlapping rule r between two different ppi types can be identified. overlapping rules can be considered as common rules between two or more ppi types. on the other hand unique rules are distinctive patterns which can be used to classify interaction sites into different ppi types. we then evaluated the following condition in order to prune the set of association rules previously generated. given two rules r and r where r is a general rule w.r.t. r arbc eliminate r if r has more significance than r sets of unique and overlapping rules were generated with the pruning procedure used in the classification. classification in the classification step we employed the pruned set of unique and overlapping rules to generate a rule profile consisting of an m × n matrix, where m is the number of examples and n is the number of different association rules obtained after the pruning step. each row of this matrix represents one of the dom-faces considered in our research and is associated with one of the ppi types we wish to classify. the rule profile matrix takes values of or depending whether the different rules are contingent or not on the respective dom-face example. a similar approach was previously employed in for protein structure comparison. the rule profile matrix was generated following algorithm and then used as input to the arbc process. algorithm generation of a rule profile input:   a set of rules and       a set of training data comprising m objects output:   an m × n matrix, rprofile method:             sort rules in the descending order of confidence and support             for each rule rj in the descending order of the rules      for each data object oi in the training data           find match between oi and rule rj                if match                     set rprofile = 1                else                     set rprofile = 0           end-for      end-for we evaluated several classification techniques for this task including decision trees, random forest, k nearest neighbor, support vector machines, and naive bayes. the weka machine learning library was used to perform these experiments. we also performed conventional classification based only on the physicochemical properties of the different dom-faces examples, without generating a set of association rules. this was done in order to evaluate if the employment of the arbc approach could be associated with a loss of information of some interacting complexes due, for example, to the pruning step or the discretisation of continuous value feature information. in all cases a fold cross validation procedure was performed. because the task of classification of different ppi types involves imbalanced classes we utilized an over-sampling strategy, incrementing the number of instances associated with those ppi types with few examples.  analysis of dom-face properties we found that % of the interaction sites studied are contained within corresponding ranges of scop domains. this suggests that the analysis of interaction sites based on structural domains does not lose interaction information. average values of diverse dom-face properties for different ppi types are shown in table the distribution of df-asa for different types is presented in supplementary figure one. it is possible to observe a distinct difference in the distribution of non-obligate and obligate complexes. the distribution patterns of dom-face area for enz are similar to those of nonenz and the same trend occurs between het and hom. in the distribution of the area of interaction sites, obligate ppi types exhibit a greater variance and in general tend to have larger interaction sites than non-obligate complexes. the average hydrophobicity values for enz, nonenz, het and hom are respectively,,, and. even though average hh values are similar for different ppi types, the histogram distributions of hydrophobicity exhibit distinctive separation patterns between non-obligate and obligate interactions. the distribution of hh for enz is similar to nonenz and that of het is similar to hom. we note that arg, his, tyr, gln and trp exhibit higher propensities than other amino acids, while gly has a low propensity in our analysis. average residue propensities are shown in table het has the highest residue propensity and hom the lowest. we also analyzed the top four frequent residues for each interaction type calculating the sum of asa for each amino acid. hydrophobic residues including leu, ala, and val frequently occur in types het and hom. the charged residue glu also appears frequently in het. in nonenz, charged residues including asp, glu, lys, and arg are present in the top four frequent residues. enz includes not only some polar residues ser and tyr but also the charged residue glu. we observed that the charged residues occur very frequently in all interaction types and appear dominantly in het. trp, cys, and met rarely occurred in interface area through all types. the average values of the size ratio between dom-face area and domain area for enz, nonenz, het, and hom are,,, and respectively as shown in table the distribution of size ratio is shown in supplementary figure four. we observed that 92% of dom-faces are smaller than a half of their domain sizes based on the calculation of asa values. the average length of consecutive residues are,, and for enz, nonenz, het, and hom respectively as shown in table the average distribution of sse elements for different ppi types is shown in figure we have seen that interaction sites are mostly composed of non-regular regions followed by helix and strand regions. enz contains % of non-regular regions, which is the highest percentage. helix content are greater than 36% in types nonenz, het and hom but are less than 17% in enz. strand content for all types are less than 20% and het exhibits the lowest value. the variation in the number of amino acids is similar to that for the number of atoms. average values for natom, naa, nsse and nfrag are shown in table we found that values for types het and hom are higher than for types enz and nonenz in all these categories. the distribution of these properties for enz is similar to nonenz. classification of ppi types we were able to discover a total of rules describing associations by employing arm. after the pruning stage a total of association rules were selected for the classification process. the number of rules associated with types enz, nonenz, het and hom are and respectively. a total of of these are unique, i.e. rules exclusively associated with just one ppi type. the remaining rules are overlapping rules related to two or more ppi types. we are interested in this distinction because unique rules appear to be related to specific characteristics of ppi types, whilst overlapping rules can be related to common attributes of different interaction types or for instance to distinctive properties between obligate and non-obligate interactions. a#. of domains: a number of domains in each ppi type; b#. of rules: a number of association rules discovered for each ppi type; cunique rules: a number of association rules associated with just one ppi type; doverlapping rules: a number of rules of which bodies are identical to those of rules in other types. the performance for different classification methods measured as total accuracy over fold cross validation for arbc is shown in table additionally we performed classification based on the physicochemical properties of the different dom-faces, and also arbc classification based on a rule profile generated using only the set of unique rules discovered. performance results for these approaches are also given in table we have seen that in all these cases svm exhibited the best performance among diverse classifiers studied, reaching over 99% accuracy in some cases. however this high accuracy suggests that overfitting problems are associated with the use of svm. the other classification approaches evaluated still exhibit a high accuracy with the exception of nb. the performance reached by them is comparable to that previously reported in although not exactly the same instances and features were employed. additionally we observed that there was no significant appreciable difference between the performance of arbc and cwar in most of the situations, although it seems that cwar performed slightly better than arbc. amethod represents different classification methods such as decision tree, random forest, k nearest neighbor, support vector machine and naive bayes; barbc: association rule based classification; ccw ar: classification based on physicochemical properties; dur: arbc classification using unique association rules; e, f, g: data sets with exclusion of sse content from all data1; 1all data: data sets including sse content; 2no sse data: data sets without inclusion of sse content. these results strongly suggest that arbc performs competitively with conventional classification approaches for this task, and consequently the use of arbc does not involve an important loss of information derived from arm. the performance of arbc using only unique rules clearly decreased for all classification methods evaluated, although maintaining an acceptable accuracy of near or over 90% in most of the cases. this suggest that unique rules can be influential in classifying most of the ppi types considered in our study and that overlapping rules are important to improve the accuracy of the classification task. it is important to emphasize that the aim of our research is focused on the advantage of interpretability of the discovered rules rather than the optimization of the classification task. we further investigated the influence of sse information on the classification of ppi types. we evaluated three different data sets without using the secondary structure elements of proteins, including arbc_wo_sse, cwar_wo_sse and ur_wo_sse. each of the two rule profiles in this case contains a total of only association rules and unique rules. results for these evaluations are also highlighted in table it was found that in all cases the performance of diverse classifiers tended to decrease when sse data was omitted, although only a slightly reduction is observed in most of the classifiers evaluated. interestingly the major decrement in performance was observed when employing ur_wo_sse, with accuracies of less than 90% for all classifiers including svm. these results strongly suggest that sse content in interaction sites could have an important role in the discrimination of different ppi types for both approaches including arbc and cwar. this implies that the average confidences of the rule sets that include this sse content information may be higher than those without it. there were % such rules that included sse content information and their average confidence was. when we considered the top rules that are covered by 20% of all the rules, their confidence was. among them, 42% contained sse information with an average confidence of. the sse content rules were enriched among those rules exhibiting higher confidences. the same trend was also seen with unique rules: while the average confidence of unique rules was, that of the unique sse rules was. here we infer that sse content in interaction sites is a significant feature that permits reliable classification of the interaction types. acon f1: average confidence of a rule subset; bcon f2: average confidence of sse content rules in a rule subset; csse: association rules encoding sse content; dtopk: top k rules covering top 20% in confidence; eunique: unique rules. interpretation of discovered association rules determination of important rules to select a set of informative and discriminative rules for the extraction of knowledge, most of the existing approaches rank the association rules based on the confidence value of a individual rule. a strong rule which is highly confident and represents general knowledge, may not be a good discriminative rule for the classification. instead, a better measure of the importance of a rule should include the following factors considered together: correlation between a property and a class, the degree of classification power, confidence and support, top k coverage and uniqueness of a rule. as noted in the previous section, the inclusion of the sse content information in our arbc approach has a positive effect on the classification accuracy. the importance of a rule can be quantified by integrating the various factors including the sse content information. we defined a importance factor by an average value of all the factors. in order to illustrate the informativeness of the rules in understanding interface features, some representative rules within the top 30% of i are listed in table the list was complemented by some other rules ranked below in order to explain overlapping rules and compare association rules to rules generated from a decision tree. similarly, rules describing the enz type with varying different structural features are listed in table rules in tables and are sorted by type and i. representative examples of rules within top 30% are listed by sorting columns type and i. rules of which order is below are added for explaining overlapping rules and the comparison to rules produced from a decision tree. a#: rule identifier; bo: order of a rule ranking by importance factor; crule description: the body of a rule; dtype: the head of a rule representing a ppi type; econf: confidence of a rule; f supp: support of a rule; gc: rules selected from correlation-based feature subset selection; hg: the worth of a rule by measuring the gain ratio with respect to ppi types; ik: top k rules ranked within top 30%; ju: unique rules; ks: sse content rules; li: importance factor of a rule calculated by an average of all factors such as conf, supp, c, g, k, u and s; "-" is replaced with value when the importance factor was calculated. abbreviation of column names is the same as that of table the enz subtypes are defined in figure note that enz_b includes both inhibitors and enzymes while the others are exclusively formed by inhibitors or enzymes. we have shown that the interaction sites were dominated by non-regular region: especially for enz interactions, almost of the sites in average were composed of non-helix and non-beta strand regions. this is manifested in rules, and all of which require – 80% content of non-regular regions to be classified as enz. some of the rules containing negation predicates are strong indicators of certain interaction types. for example, "nohelix " and "nostrand " in the interaction sites imply enz and nonenz, respectively. het is characterized by relatively small portions of strands and "nostrand ". it is also observed that rules containing such sse content information conjuncted with other properties or combined with other rules, and 3) become stronger discriminators for classifying ppi types than rules containing only sse content information. we note that some rules containing sse information with scop classes are the most discriminative and informative in order to characterize enz and nonenz. inference of subtypes some rules which share the same sets of properties but differ in their value ranges or have other properties can be effective in order to compare features of different interaction types or to identify subtypes in a ppi type. for example, among the top 30% rules, rules and describe types enz and nonenz respectively, using the same set of properties such as number of atoms and df-asa. however, their values imply that the interaction sites of nonenz are larger than those of enz. the ranges of size scales of interaction sites in enz are presented in rules and that share the same set of properties but differ in their values. the overall size of interaction sites in enz are described by rule with the highest confidence among those rules encoding the size of interaction sites. these are interesting cases where the structural difference between types can be directly inferred and subtypes of a ppi type can be derived by grouping different features of interaction sites. we deduced five subtypes of enz and a hierarchical tree to account for those subtypes. we compiled a list of representative association rules to show structural features different among these subtypes. we note that interaction sites of enzymes are distinguished from those of inhibitors in enzyme-inhibitor complexes. interaction sites for inhibitors are relatively small, i.e., mainly < Å^, and are made up of strands and mostly non-regular regions without helix content which is very informative in order to characterize inhibitors. remarkably rules and generalize common features of inhibitors with respect to the size of interaction sites and sse content. as rule was considered to be very discriminative to differentiate enz from other types, it can depict characteristics of a small group of inhibitors with indicating that inhibitors in scop class do not contain helix in interaction sites, and 3). in contrast, enzymes have larger interaction sites than their inhibitors and form mixtures of helices and strands in interaction sites. both rules and show that enzymes have sses twice as many as inhibitors. this indicates that both enzymes and inhibitors may contain mainly strands as regular sses in interaction sites since enzymes are included in scop class and inhibitors do not contain helices in interaction sites. this suggests that non regular regions and beta strands are mainly involved in the interfaces of enzyme-inhibitor interactions. such extracted information can be useful for the prediction of interaction sites for enzyme-inhibitor complexes. this observation is demonstrated by some small inhibitors in type enz_a and type enz_b. those inhibitors interact with enzymes in type enz_b. the enzymes described by rules and are included in scop superfamily trypsin-like serine proteases and the inhibitors are mainly in scop class which is composed of small proteins dominated by metal ligand, heme, and disulfide bridges. it is possible in a similar way to infer subtypes of other ppi types. among ppi types, enz has plenty of rules to derive subtypes. hence, the comparative analysis of association rules was presented for enz. comparison of association rules to part rules to improve our understanding of the association rules discovered, we compared part rules produced from a decision tree built using c over our properties with the association rules. there were a total of part rules generated and their average confidence and support were and respectively. we have collected a representative list of part rules in table in the comparison of the association rules with part rules, part rules are more complicated with the composition of more predicates in rule bodies than those in association rules. typically, one part rule corresponds to more than ~ association rules. both rules provided quantitative descriptions. however, property values in part rules represent split points for classification and are not represented by intervals of quantitative values. some part rules including identical properties with different split points in the same rule bodies were not clear enough to determine decision boundaries of properties. these limit the readability and understandability of part rules whilst the association rules were simple enough to be interpreted by users. it was also possible with association rules to support the comparative analysis of rules between different ppi types as we inferred the possibility of subtypes and relative information by comparison of size scales of interaction sites in enz. a set of association rules discovered by arm comprises mostly weak rules together with a small number of strong rules. on the contrary, most part rules consist of a number of very strong rules which have the highest confidences and low supports. a: a total of rules produced by a decision tree using c algorithm in weka machine learning library; b#: part rule identifier; ccorresponding rules: association rule identifiers corresponding to a part rule. one of the most notable differences between association rules and part rules is in how to handle overlapping rules between different types. if two different interaction types are predicted from the identical head of a rule, these are called overlapping rules. there were such cases out of a total of rules. their distribution is illustrated in supplementary figure nine. table shows representative examples of overlapping rules. examination of the overlapping rules shared by enz and nonenz indicated that these types are similar in terms of df-asa, natom, and naa differentiated by combination with the rest of properties such as sse content, average length of consecutive residues, size ratio, and hydrophobicity. part rules are unique cross ppi types. examples of overlapping rule are selected from tables and a# rule identifier; b#: rule identifier in tables and 7; rule descriptionc: the body of overlapping rules between the two types; dtypes: ppi type and type having overlapping rules in common; e, gcon f: confidences of overlapping rules for type and type respectively; f, hsupp: supports of overlapping rules for type and type respectively.  we have developed a classification method that categorizes each ppi into one of four different types using association rule based classification. the application of association rule mining over known ppi domains using properties yielded a total of rules, which in turn discriminated the features of interaction sites for different ppi types and were used to generate a classification model to predict ppi types. our arbc approach performed competitively compared with conventional methods applied directly to the property values: for example, the work in reported an accuracy of % for the classification of three types of interactions by directly applying svm. although it is not possible to make a direct comparison of their method with ours due to heterogeneity of the data set, this suggests that the processes of association rule generation and subsequent pruning do not incur a loss of relevant information. at the same time, our results demonstrated that we were able to considerably improve the accuracy of the prediction of ppi types through the use of structural domain information for the description of interaction interfaces, and also the use of secondary structure content. although sse content alone could not classify interaction sites with high accuracy, its incorporation with other properties improved the accuracy of classification. our approach based on arbc has a clear advantage over conventional methods because results are reported in terms of rules that are a quantitative description of properties and hence their interpretation is straightforward and simple. thus, biologists can easily judge if a discovered rule is interesting or not. analysis of common and unique properties together is a unique feature of our approach, unlike conventional classification methods which typically capture unique properties only. common rules capture those properties which are common between ppi types. in particular enzyme inhibitor and non-enzyme inhibitor interactions, both being non-obligate or transient, share more properties in common than with other types. as we have demonstrated, all these features produce descriptive rules, enabling their simple and powerful interpretation. we observed that the property distributions of homo-obligate interactions are similar to those of hetero-obligate interactions but distinct from those of non-obligate interactions. we found that obligate interactions have larger and more hydrophobic interaction sites than non-obligate interactions. hydrophobic residues including leu, ala, and val were found more frequently in obligate interactions whilst polar residues including ser and gly were present in non-obligate interactions. charged residues were seen frequently in all interaction types. on the basis of a detailed analysis of association rules, it was observed that interactions between enzymes and their inhibitors were separated into several different structural subgroups. this may lead to the possibility of different subtypes of ppis being involved in transient interactions. our findings based on the interpretation of association rules are consistent with the description of obligate complexes in previous studies. in future work we plan to improve our approach by incorporating additional properties such as energy functions and electric potentials for the generation of more accurate and meaningful association rules. the unique contribution of our work is the development of a novel methodology that analyzes specificities and commonalities for interaction types, and we intend to extend this to the prediction of interaction partner and interaction sites. authors' contributions shp developed the concept and the method under the supervision of drg. jar carried out classification and participated in drafting the paper. sk interpreted the results for the point of view of a biologist. jwk developed the web application. shp drafted the paper, jar, drg and sk finalized the draft. all authors read and approved the final manuscript. supplementary material additional file 1 calculation of residue propensity. a table shows aa propensity for amino acids and a equation represents the calculation of residue propensity. click here for file additional file 2 association rules. a set of association rules discovered for all types presents and rules are sorted by type and i. click here for file additional file 3 distribution of dom-face properties. the figures represent the statistical distributions of dom-face properties for four ppi types. click here for file acknowledgements we are grateful to dr k. r. lee at ssu for helpful discussions. we thank dr. j. r. bradford and prof. d. r. westhead at university of leeds, h. neuvirth and g. schreiber at weizmann institute of science for providing their data sets. shp was supported by the korea research foundation grant funded by the korean government. jar has been supported by the programme alβan, the european union programme of high level scholarships for latin america, scholarship e04d034854cl. sk was supported by soongsil university research fund.
 interface properties were calculated from amino acid and secondary structure composition and then used to generate a set of association rules characterizing these domain-interaction sites employing the apriori algorithm. the identification and characterization of these ppi types may help in the functional annotation of new protein complexes and in the prediction of protein interaction partners by knowledge driven approaches. we incorporated domain information from protein complexes in scop proteins and identified domain-interaction sites. this work addresses pattern discovery of the interaction sites for four different interaction types to characterize and uses them for the prediction of ppi types employing association rule based classification which includes association rule generation and posterior classification. we also showed that the accuracy of the classification can be improved through the use of structural domain information and also the use of secondary structure content. protein-protein interactions can be classified according to their characteristics into, for example obligate or transient interactions. our results regarding the classification of ppi types based on a set of discovered association rules shows that the discriminative ability of association rules can significantly impact on the prediction power of classification models. a web application based on our method can be found at the advantage of our approach is that we can extract biologically significant information from the interpretation of the discovered association rules in terms of understandability and interpretability of rules.
 protein-protein interactions can be classified according to their characteristics into, for example obligate or transient interactions. the identification and characterization of these ppi types may help in the functional annotation of new protein complexes and in the prediction of protein interaction partners by knowledge driven approaches.  this work addresses pattern discovery of the interaction sites for four different interaction types to characterize and uses them for the prediction of ppi types employing association rule based classification which includes association rule generation and posterior classification. we incorporated domain information from protein complexes in scop proteins and identified domain-interaction sites. interface properties were calculated from amino acid and secondary structure composition and then used to generate a set of association rules characterizing these domain-interaction sites employing the apriori algorithm. our results regarding the classification of ppi types based on a set of discovered association rules shows that the discriminative ability of association rules can significantly impact on the prediction power of classification models. we also showed that the accuracy of the classification can be improved through the use of structural domain information and also the use of secondary structure content.  the advantage of our approach is that we can extract biologically significant information from the interpretation of the discovered association rules in terms of understandability and interpretability of rules. a web application based on our method can be found at 