ACM Home Page
Please provide us with feedback. Feedback
Distance-function design and fusion for sequence data
Full text PdfPdf (184 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the thirteenth ACM international conference on Information and knowledge management table of contents
Washington, D.C., USA
SESSION: DB-4 (databases): similarity search table of contents
Pages: 324 - 333  
Year of Publication: 2004
ISBN:1-58113-874-1
Authors
Yi Wu  University of California, Santa Barbara, CA
Edward Y. Chang  University of California, Santa Barbara, CA
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 65,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031171.1031238
What is a DOI?

ABSTRACT

Sequence-data mining plays a key role in many scientific studies and real-world applications such as bioinformatics, data stream, and sensor networks, where sequence data are processed and their semantics interpreted. In this paper we address two relevant issues: sequence-data representation, and representation-to-semantics mapping. For representation, since the best one is dependent upon the application being used and even the type of query, we propose representing sequence data in multiple views. For each representation, we propose methods to construct a <i>valid kernel</i> as the distance function to measure <i>similarity</i> between sequences. For mapping, we then find the best combination of the individual distance functions, which measure similarity of different views, to depict the target semantics. We propose a <i>super-kernel function-fusion</i> scheme to achieve the optimal mapping. Through theoretical analysis and empirical studies on UCI and real world datasets, we show our approach of multi-view representation and fusion to be mathematically valid and very effective for practical purposes.


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
 
2
 
3
 
4
5
 
6
 
7
 
8
 
9
G. Chartrand. Introductory graph theory. New York: Dover, 1985.
 
10
L. Chen, M. Tamer, and V. Oria. Symbolic representation and retrieval of moving object trajectories. University of Waterloo School of Computer Science Waterloo, Canada, Technical Report CS-2003-30., 2003.
 
11
C. S. Daw, C. E. A. Finney, and E. R. Tracy. A review of symbolic analysis of experimental data. Review of Scientific Instruments, 74(2), 2003.
12
 
13
 
14
L. Hammel and J. Patel. Searching on the secondary structure of protein sequences. Proceedings of the 28th VLDB Conference, 2002.
 
15
T. Hishiki, N. Collier, C. Nobata, T. Ohta, N. Ogata, T. Sekimizu, R. Steiner, H. Park, and J. Tsujii. Developing nlp tools for genome informatics: An information extraction perspective. In Genome Informatics. Universal Academy Press, Inc., Tokyo, Japan, 1998., 1998.
16
 
17
Y. Huhtala, J. Karkkainen, and H. Toivonen. Mining for similarities in aligned time series using wavelets. Data Mining and Knowlege Discovery: Theory, Tools, and Technology, SPIE Proceeding Series, 1999.
 
18
 
19
 
20
H. JA and M. BJ. The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology, 143(1), 1982.
21
22
 
23
24
 
25
G. R. G. Lanckriet, M. H. Deng, N. Cristianini, M. I. Jordan, and W. S. Noble. Kernel-based data fusion and its application to protein function prediction in yeast. Proceedings of the Pacific Symposium on Biocomputing, 2004.
26
 
27
V. Moulton, M. Zuker, M. Steel, R. Pointon, and D. Penny. Metrics on rna secondary structures. Journal of Computational Biology, 2000.
 
28
S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of molecular biology, 1970.
29
 
30
V. Roth, J. Laub, J. Buhmann, and K.-R. Muller. Going metric: Denoising pairwise data. In Neural Information Processing Systems (NIPS), 2002.
 
31
V. Roth and V. Steinhage. Nonlinear discriminant analysis using kernel functions. NIPS, 1999.
 
32
B. Scholkopf and A. Smola. Learning with kernels. MIT Press, 2001.
 
33
T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of molecular biology, 1981.
 
34
 
35
C. Watkins. Dynamic alignment kernels. Technical Report CSD-TR-98-11, 1999.
36
 
37
Y. Wu, C.-Y. Lin, E. Y. Chang, and J. R. Smith. Multimodal kernel fusion for news video concept detection. IEEE International Conference on Image Processing (ICIP), 2004.