Results 1 - 10 of 3,012

On combining classifiers

by Josef Kittler, Mohamad Hatef, Robert P. W. Duin, Jiri Matas - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1998
"... We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental ..."
Abstract - Cited by 1420 (33 self) - Add to MetaCart
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision

Functional discovery via a compendium of expression profiles.

by Timothy R Hughes , Matthew J Marton , Allan R Jones , Christopher J Roberts , Roland Stoughton , Christopher D Armour , Holly A Bennett , Ernest Coffey , Hongyue Dai , Ross-Macdonald , Yudong D He , Matthew J Kidd , Amy M King , Michael R Meyer , David Slade , Pek Y Lum , Sergey B Stepaniants , Daniel D Shoemaker , Julian Simon , Martin Bard - Cell, , 2000
"... provided that the cellular transcriptional response to frames encode proteins required for sterol metabodisruption of different steps in the same pathway is lism, cell wall function, mitochondrial respiration, or similar, and that there are sufficiently unique transcripprotein synthesis. We also sh ..."
Abstract - Cited by 547 (9 self) - Add to MetaCart
dyclonine. sion measurement. Using a comprehensive database of reference profiles, the pathway(s) perturbed by an Introduction uncharacterized mutation would be ascertained by simply asking which expression patterns in the database Systematic approaches for identifying the biological its profile most

Frequent Subgraph Discovery

by Michihiro Kuramochi, George Karypis , 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract - Cited by 406 (10 self) - Add to MetaCart
of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of discovering subgraphs that occur frequently over the entire set of graphs. In this paper we present a

Destruction-Managed Singleton: a compound pattern for reliable deallocation of singletons

by Evgeniy Gabrilovich - C++ Report , 2000
"... Factory, to name but a few). 3 The name "compound pattern" is used hereafter, to keep with John Vlissides' current usage of the term. Application Logger Resource process() instance() Logger() instance() Resource() log() ~Resource() instance() ~Logger() Disaster: Logger d ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Factory, to name but a few). 3 The name "compound pattern" is used hereafter, to keep with John Vlissides' current usage of the term. Application Logger Resource process() instance() Logger() instance() Resource() log() ~Resource() instance() ~Logger() Disaster: Logger

JOINT DISTRIBUTIONS ASSOCIATED WITH COMPOUND PATTERNS IN A SEQUENCE OF MARKOV DEPENDENT MULTISTATE TRIALS AND ESTIMATION PROBLEMS

by Kiyoshi Inoue , Sigeo Aki , 2007
"... Let Λi, 1 ≤ i ≤ be simple patterns, i.e., finite sequences of outcomes from a set Γ = {b1, b2, . . . , bm} and let Λ be a compound pattern (a set of distinct simple patterns). In this paper, we study joint distributions of the waiting time until the r-th occurrence of the compound pattern Λ, and th ..."
Abstract - Add to MetaCart
Let Λi, 1 ≤ i ≤ be simple patterns, i.e., finite sequences of outcomes from a set Γ = {b1, b2, . . . , bm} and let Λ be a compound pattern (a set of distinct simple patterns). In this paper, we study joint distributions of the waiting time until the r-th occurrence of the compound pattern Λ

Age differences in visual search for compound patterns: Long- versus short-range grouping

by Jacob A. Burack, James T. Enns, Grace Iarocci, Beth R - Developmental Psychology , 2000
"... Visual search for compound patterns was examined in observers aged 6, 8, 10, and 22 years. The main question was whether age-related improvement insearch rate (response time slope over number of items) was different for patterns defined by short- versus long-range spatial relations. Perceptual ccess ..."
Abstract - Cited by 14 (3 self) - Add to MetaCart
Visual search for compound patterns was examined in observers aged 6, 8, 10, and 22 years. The main question was whether age-related improvement insearch rate (response time slope over number of items) was different for patterns defined by short- versus long-range spatial relations. Perceptual

On waiting time distributions associated with compound patterns in a sequence of multi-state trials

by Kiyoshi Inoue, Sigeo Aki , 2009
"... ..."
Abstract - Add to MetaCart
Abstract not found

Finding Frequent Substructures in Chemical Compounds

by Luc Dehaspe, Hannu Toivonen, Ross Donald King , 1998
"... The discovery of the relationships between chemical structure and biological function is central to biological science and medicine. In this paper we apply data mining to the problem of predicting chemical carcinogenicity. This toxicology application was launched at IJCAI'97 as a research chall ..."
Abstract - Cited by 133 (11 self) - Add to MetaCart
challenge for artificial intelligence. Our approach to the problem is descriptive rather than based on classification; the goal being to find common substructures and properties in chemical compounds, and in this way to contribute to scientific insight. This approach contrasts with previous machine learning

Packet Trains: Measurements and a New Model for Computer Network Traffic

by Raj Jain, Shawn A. Routhier - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 1986
"... Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor compound Poisson. An alternative model called “packet train” is proposed. In the train ..."
Abstract - Cited by 202 (7 self) - Add to MetaCart
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor compound Poisson. An alternative model called “packet train” is proposed. In the train

Graph Indexing: A Frequent Structure-based Approach

by Xifeng Yan , Philip S. Yu, Jiawei Han , 2004
"... Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graph-based indices. In this paper, we investigate the is ..."
Abstract - Cited by 201 (25 self) - Add to MetaCart
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graph-based indices. In this paper, we investigate
Results 1 - 10 of 3,012