Proquest Dissertations
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Proceedings of International Conference on Electrical, Electronics & Computer Science
Interscience Research Network Interscience Research Network Conference Proceedings - Full Volumes IRNet Conference Proceedings 12-9-2012 Proceedings of International Conference on Electrical, Electronics & Computer Science Prof.Srikanta Patnaik Mentor IRNet India, [email protected] Follow this and additional works at: https://www.interscience.in/conf_proc_volumes Part of the Electrical and Electronics Commons, and the Systems and Communications Commons Recommended Citation Patnaik, Prof.Srikanta Mentor, "Proceedings of International Conference on Electrical, Electronics & Computer Science" (2012). Conference Proceedings - Full Volumes. 61. https://www.interscience.in/conf_proc_volumes/61 This Book is brought to you for free and open access by the IRNet Conference Proceedings at Interscience Research Network. It has been accepted for inclusion in Conference Proceedings - Full Volumes by an authorized administrator of Interscience Research Network. For more information, please contact [email protected]. Proceedings of International Conference on Electrical, Electronics & Computer Science (ICEECS-2012) 9th December, 2012 BHOPAL, India Interscience Research Network (IRNet) Bhubaneswar, India Rate Compatible Punctured Turbo-Coded Hybrid Arq For Ofdm System RATE COMPATIBLE PUNCTURED TURBO-CODED HYBRID ARQ FOR OFDM SYSTEM DIPALI P. DHAMOLE1& ACHALA M. DESHMUKH2 1,2Department of Electronics and Telecommunications, Sinhgad College of Engineering, Pune 411041, Maharashtra Abstract-Now a day’s orthogonal frequency division multiplexing (OFDM) is under intense research for broadband wireless transmission because of its robustness against multipath fading. A major concern in data communication such as OFDM is to control transmission errors caused by the channel noise so that error free data can be delivered to the user. Rate compatible punctured turbo (RCPT) coded hybrid ARQ (RCPT HARQ) has been found to give improved throughput performance in a OFDM system. -
Text Classification Using String Kernels
Journal of Machine Learning Research 2 (2002) 419-444 Submitted 12/00;Published 2/02 Text Classification using String Kernels Huma Lodhi [email protected] Craig Saunders [email protected] John Shawe-Taylor [email protected] Nello Cristianini [email protected] Chris Watkins [email protected] Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK Editor: Bernhard Sch¨olkopf Abstract We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguously. The subsequences are weighted by an exponentially decaying factor of their full length in the text, hence emphasising those occurrences that are close to contiguous. A direct computation of this feature vector would involve a prohibitive amount of computation even for modest values of k, since the dimension of the feature space grows exponentially with k. The paper describes howdespite this fact the inner product can be efficiently evaluated by a dynamic programming technique. Experimental comparisons of the performance of the kernel compared with a stan- dard word feature space kernel (Joachims, 1998) show positive results on modestly sized datasets. The case of contiguous subsequences is also considered for comparison with the subsequences kernel with different decay factors. For larger documents and datasets the paper introduces an approximation technique that is shown to deliver good approximations efficiently for large datasets. -
Fast String Kernels Using Inexact Matching for Protein Sequences
JournalofMachineLearningResearch5(2004)1435–1455 Submitted 1/04; Revised 7/04; Published 11/04 Fast String Kernels using Inexact Matching for Protein Sequences Christina Leslie [email protected] Center for Computational Learning Systems Columbia University New York, NY 10115, USA Rui Kuang [email protected] Department of Computer Science Columbia University New York, NY 10027, USA Editor: Kristin Bennett Abstract We describe several families of k-mer based string kernels related to the recently presented mis- match kernel and designed for use with support vector machines (SVMs) for classification of pro- tein sequence data. These new kernels – restricted gappy kernels, substitution kernels, and wildcard kernels – are based on feature spaces indexed by k-length subsequences (“k-mers”) from the string alphabet Σ. However, for all kernels we define here, the kernel value K(x,y) can be computed in O(cK( x + y )) time, where the constant cK depends on the parameters of the kernel but is inde- pendent| | of the| | size Σ of the alphabet. Thus the computation of these kernels is linear in the length of the sequences, like| | the mismatch kernel, but we improve upon the parameter-dependent con- m+1 m stant cK = k Σ of the (k,m)-mismatch kernel. We compute the kernels efficiently using a trie data structure and| | relate our new kernels to the recently described transducer formalism. In protein classification experiments on two benchmark SCOP data sets, we show that our new faster kernels achieve SVM classification performance comparable to the mismatch kernel and the Fisher kernel derived from profile hidden Markov models, and we investigate the dependence of the kernels on parameter choice. -
Efficient Global String Kernel with Random Features: Beyond Counting Substructures
Efficient Global String Kernel with Random Features: Beyond Counting Substructures Lingfei Wu∗ Ian En-Hsu Yen Siyu Huo IBM Research Carnegie Mellon University IBM Research [email protected] [email protected] [email protected] Liang Zhao Kun Xu Liang Ma George Mason University IBM Research IBM Research [email protected] [email protected] [email protected] Shouling Ji† Charu Aggarwal Zhejiang University IBM Research [email protected] [email protected] ABSTRACT of longer lengths. In addition, we empirically show that RSE scales Analysis of large-scale sequential data has been one of the most linearly with the increase of the number and the length of string. crucial tasks in areas such as bioinformatics, text, and audio mining. Existing string kernels, however, either (i) rely on local features of CCS CONCEPTS short substructures in the string, which hardly capture long dis- • Computing methodologies → Kernel methods. criminative patterns, (ii) sum over too many substructures, such as all possible subsequences, which leads to diagonal dominance KEYWORDS of the kernel matrix, or (iii) rely on non-positive-definite similar- String Kernel, String Embedding, Random Features ity measures derived from the edit distance. Furthermore, while there have been works addressing the computational challenge with ACM Reference Format: respect to the length of string, most of them still experience qua- Lingfei Wu, Ian En-Hsu Yen, Siyu Huo, Liang Zhao, Kun Xu, Liang Ma, Shouling Ji, and Charu Aggarwal. 2019. Efficient Global String Kernel dratic complexity in terms of the number of training samples when with Random Features: Beyond Counting Substructures . -
String & Text Mining in Bioinformatics
Data Mining in Bioinformatics Day 9: String & Text Mining in Bioinformatics Karsten Borgwardt February 21 to March 4, 2011 Machine Learning & Computational Biology Research Group MPIs Tübingen Karsten Borgwardt: Data Mining in Bioinformatics, Page 1 Why compare sequences? Protein sequences Proteins are chains of amino acids. 20 different types of amino acids can be found in protein sequences. Protein sequence changes over time by mutations, dele- tion, insertions. Different protein sequences may diverge from one com- mon ancestor. Their sequences may differ slightly, yet their function is often conserved. Karsten Borgwardt: Data Mining in Bioinformatics, Page 2 Why compare sequences? Biological Question: Biologists are interested in the reverse direction: Given two protein sequences, is it likely that they origi- nate from the same common ancestor? Computational Challenge: How to measure similarity between two protein se- quence, or equivalently: How to measure similarity between two strings Kernel Challenge: How to measure similarity between two strings via a ker- nel function In short: How to define a string kernel Karsten Borgwardt: Data Mining in Bioinformatics, Page 3 History of sequence comparison First phase Smith-Waterman BLAST Second phase Profiles Hidden Markov Models Third phase PSI-Blast SAM-T98 Fourth phase Kernels Karsten Borgwardt: Data Mining in Bioinformatics, Page 4 Sequence comparison: Phase 1 Idea Measure pairwise similarities between sequences with gaps Methods Smith-Waterman dynamic programming high accuracy slow (O(n2)) -
Text Classification Using String Kernels
Journal of Machine Learning Research 2 (2002) 419-444 Submitted 12/00;Published 2/02 Text Classification using String Kernels Huma Lodhi [email protected] Craig Saunders [email protected] John Shawe-Taylor [email protected] Nello Cristianini [email protected] Chris Watkins [email protected] Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK Editor: Bernhard Sch¨olkopf Abstract We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguously. The subsequences are weighted by an exponentially decaying factor of their full length in the text, hence emphasising those occurrences that are close to contiguous. A direct computation of this feature vector would involve a prohibitive amount of computation even for modest values of k, since the dimension of the feature space grows exponentially with k. The paper describes howdespite this fact the inner product can be efficiently evaluated by a dynamic programming technique. Experimental comparisons of the performance of the kernel compared with a stan- dard word feature space kernel (Joachims, 1998) show positive results on modestly sized datasets. The case of contiguous subsequences is also considered for comparison with the subsequences kernel with different decay factors. For larger documents and datasets the paper introduces an approximation technique that is shown to deliver good approximations efficiently for large datasets.