TY - GEN
T1 - Association analysis-based transformations for protein interaction networks
T2 - KDD-2007: 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
AU - Pandey, Gaurav
AU - Steinbach, Michael
AU - Gupta, Rohit
AU - Garg, Tushar
AU - Kumar, Vipin
PY - 2007
Y1 - 2007
N2 - Protein interaction networks are one of the most promising types of biological data for the discovery of functional modules and the prediction of individual protein functions. However, it is known that these networks are both incomplete and inaccurate, i.e., they have spurious edges and lackbiologically valid edges. One way to handle this problem is by transforming the original interaction graph into new graphs that remove spurious edges, add biologically valid ones, and assign reliability scores to the edges constituting the final network. We investigate currently existing methods, as well as propose a robust association analysis-based method for this task. This method is based on the concept of h-confidence, which is a measure that can be used to extract groups of objects having high similarity with each other. Experimental evaluation on several protein interaction data sets show that hyperclique-based transformations enhance the performance of standard function prediction algorithms significantly, and thus have merit.
AB - Protein interaction networks are one of the most promising types of biological data for the discovery of functional modules and the prediction of individual protein functions. However, it is known that these networks are both incomplete and inaccurate, i.e., they have spurious edges and lackbiologically valid edges. One way to handle this problem is by transforming the original interaction graph into new graphs that remove spurious edges, add biologically valid ones, and assign reliability scores to the edges constituting the final network. We investigate currently existing methods, as well as propose a robust association analysis-based method for this task. This method is based on the concept of h-confidence, which is a measure that can be used to extract groups of objects having high similarity with each other. Experimental evaluation on several protein interaction data sets show that hyperclique-based transformations enhance the performance of standard function prediction algorithms significantly, and thus have merit.
KW - Association analysis
KW - H-confidence
KW - Noise reduction
KW - Protein function prediction
KW - Protein interaction networks
UR - https://www.scopus.com/pages/publications/36849041067
UR - https://www.scopus.com/inward/citedby.url?scp=36849041067&partnerID=8YFLogxK
U2 - 10.1145/1281192.1281251
DO - 10.1145/1281192.1281251
M3 - Conference contribution
AN - SCOPUS:36849041067
SN - 1595936092
SN - 9781595936097
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 540
EP - 549
BT - KDD-2007
Y2 - 12 August 2007 through 15 August 2007
ER -