| P-tree classification of yeast gene deletion data |
| Full text |
Pdf
(38 KB)
|
| Source
|
ACM SIGKDD Explorations Newsletter
archive
Volume 4 , Issue 2 (December 2002)
table of contents
Pages: 108 - 109
Year of Publication: 2002
ISSN:1931-0145
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 21, Citation Count: 3
|
|
|
ABSTRACT
Genomics data has many properties that make it different from "typical" relational data. The presence of multi-valued attributes as well as the large number of null values led us to a P-tree-based bit-vector representation in which matching 1-values were counted to evaluate similarity between genes. Quantitative information such as the number of interactions was also included in the classifier. Interaction information allowed us to extend the known properties of one protein with information on its interacting neighbors. Different feature attributes were weighted independently. Relevance of different attributes was systematically evaluated through optimization of weights using a genetic algorithm. The AROC value for the classified list was used as the fitness function for the genetic algorithm.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Craven, M., "KDD Cup 2002", http://www.biostat.wisc.edu/~craven/kddcup/.
|
| |
2
|
|
 |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
Perrizo, W., "Peano Count Tree Lab Notes," CSOR-TR-01-1, NDSU, Fargo, ND, 2001.
|
| |
7
|
|
| |
8
|
UCI, "UCI Machine Learning Repository", http://www.ics.uci.edu/~mlearn/MLSummary.html
|
|