Results 1 - 10 of 21,236

Hybridization Methods

by Jill E. Clarridgel , 1992
"... Detection of Mycobacterium tuberculosis in clinical specimens by the polymerase chain reaction (PCR) was compared with detection by culture. A 317-bp segment within the M. tuberculosis-specific insertion sequence IS6110 was amplified. The detection limit of the PCR assay for cultured mycobacteria wa ..."
Abstract - Add to MetaCart
was 50 cells per reaction by ethidium bromide-stained agarose gel electrophoresis and 5 cells per reaction by hybridization with an oligonucleotide probe conjugated with either digoxigenin or alkaline phosphatase (AP). This sensitivity was reduced fivefold in sputum specimens seeded with M. tuberculosis

Probabilistic Inference Using Markov Chain Monte Carlo Methods

by Radford M. Neal , 1993
"... Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because probabilistic models with the necessary realism and flexibility lead to complex distributions over high-dimensional spaces. R ..."
Abstract - Cited by 736 (24 self) - Add to MetaCart
, and has recently been unified with the Metropolis algorithm to produce the "hybrid Monte Carlo" method. In computer science, Markov chain sampling is the basis of the heuristic optimization technique of "simulated annealing", and has recently been used in randomized algorithms

Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding

by Brian Chen, Gregory W. Wornell - IEEE TRANS. ON INFORMATION THEORY , 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, mini ..."
Abstract - Cited by 496 (14 self) - Add to MetaCart
, minimizing distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortion-compensated QIM (DC-QIM), and develop convenient realizations in the form of what we

Knowledge-based Analysis of Microarray Gene Expression Data By Using Support Vector Machines

by Michael P. S. Brown, William Noble Grundy, David Lin, Nello Cristianini, Charles Walsh Sugnet, Terrence S. Furey, Manuel Ares, Jr., David Haussler , 2000
"... We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of ..."
Abstract - Cited by 520 (8 self) - Add to MetaCart
We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge

Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions

by Gediminas Adomavicius, Alexander Tuzhilin - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 2005
"... This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches. This paper also describes vario ..."
Abstract - Cited by 1490 (23 self) - Add to MetaCart
This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches. This paper also describes

Using Bayesian networks to analyze expression data

by Nir Friedman, Michal Linial, Iftach Nachman - Journal of Computational Biology , 2000
"... DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a “snapshot ” of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key biologica ..."
Abstract - Cited by 1088 (17 self) - Add to MetaCart
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a “snapshot ” of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key

A case study of open source software development: the Apache server

by Audris Mockus, Roy T. Fielding, James Herbsleb - In: Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000 , 2000
"... According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source applica ..."
Abstract - Cited by 806 (32 self) - Add to MetaCart
According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source

Application of Phylogenetic Networks in Evolutionary Studies

by Daniel H. Huson, David Bryant - SUBMITTED TO MBE 2005 , 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract - Cited by 887 (15 self) - Add to MetaCart
evolution proceeds in a tree-like manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when

Fab: Content-based, collaborative recommendation

by Marko Balabanovic, Yoav Shoham - Communications of the ACM , 1997
"... Fab is a recommendation system designed to help users sift through the enormous amount of information available in the World Wide Web. Operational since Dec. 1994, this system combines the content-based and collaborative methods of recommendation in a way that exploits the advantages of the two appr ..."
Abstract - Cited by 682 (0 self) - Add to MetaCart
Fab is a recommendation system designed to help users sift through the enormous amount of information available in the World Wide Web. Operational since Dec. 1994, this system combines the content-based and collaborative methods of recommendation in a way that exploits the advantages of the two

A comparison of string distance metrics for name-matching tasks

by William W. Cohen, Pradeep Ravikumar, Stephen E. Fienberg , 2003
"... Using an open-source, Java toolkit of name-matching methods, we experimentally compare string distance metrics on the task of matching entity names. We investigate a number of different metrics proposed by different communities, including edit-distance metrics, fast heuristic string comparators, tok ..."
Abstract - Cited by 446 (11 self) - Add to MetaCart
, token-based distance metrics, and hybrid methods. Overall, the best-performing method is a hybrid scheme combining a TFIDF weighting scheme, which is widely used in information retrieval, with the Jaro-Winkler string-distance scheme, which was developed in the probabilistic record linkage community.
Results 1 - 10 of 21,236