Results 1  10
of
1,059
Exploiting Generative Models in Discriminative Classifiers
 In Advances in Neural Information Processing Systems 11
, 1998
"... Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often resu ..."
Abstract

Cited by 551 (9 self)
 Add to MetaCart
result in classification performance superior to that of the model based approaches. An ideal classifier should combine these two complementary approaches. In this paper, we develop a natural way of achieving this combination by deriving kernel functions for use in discriminative methods such as support
Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews
, 2003
"... The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of product attributes (quality, features, etc.) and aggregating opinions about each of them (poor, mixe ..."
Abstract

Cited by 453 (0 self)
 Add to MetaCart
The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of product attributes (quality, features, etc.) and aggregating opinions about each of them (poor
SPRINT: A scalable parallel classifier for data mining
, 1996
"... Classification is an important data mining problem. Although classification is a wellstudied problem, most of the current classification algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over large databases. ..."
Abstract

Cited by 312 (8 self)
 Add to MetaCart
. This parallelization, also presented here, exhibits excellent scalability as well. The combination of these characteristics makes the proposed algorithm an ideal tool for data mining. 1
Developments in the Measurement of Subjective WellBeing
 Psychological Science.
, 1993
"... F or good reasons, economists have had a longstanding preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract

Cited by 284 (7 self)
 Add to MetaCart
the respondents' remembered utility. The evaluation of remembered utility requires the individual to remember a stream of experiences and to aggregate them in some way. Ideally, one would hope that the individual who reports his or her overall remembered utility for a period performs the task of summing
The ideals of an ideal extension ∗
, 2009
"... Given two unital associative rings R ⊆ S, the ring S is said to be an ideal (or Dorroh) extension of R if S = R ⊕ I, for some ideal I ⊆ S. In this note we investigate the ideal structure of an arbitrary ideal extension of an arbitrary ring R. In particular, we describe the Jacobson and upper nil rad ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
radicals of such a ring, in terms of the Jacobson and upper nil radicals of R, and we determine when such a ring is prime and when it is semiprime. We also classify all the prime and maximal ideals of an ideal extension S of R, under certain assumptions on the ideal I. These are generalizations of earlier
On the path to an ideal ROC curve: Considering cost asymmetry in learning classifiers
 Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS
, 2005
"... Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with false positives and false negatives. For linear classifiers, the set of classifiers is typically obtained by training once, ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with false positives and false negatives. For linear classifiers, the set of classifiers is typically obtained by training once
The ideal structure of C∗algebras of infinite graphs
 ILLINOIS J. MATH
, 2001
"... We classify the gaugeinvariant ideals in the C∗algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gaugeinvariant primitive ideals in terms of the structural properties of the graph, and describe the Ktheory of the C ∗al ..."
Abstract

Cited by 60 (4 self)
 Add to MetaCart
We classify the gaugeinvariant ideals in the C∗algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gaugeinvariant primitive ideals in terms of the structural properties of the graph, and describe the Ktheory of the C
Resolutions of facet ideals
 Department of Mathematics, University of Missouri, Mathematical Sciences Building
"... Abstract. In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszu ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
in codimension 1, and classify all trees whose facet ideal has a linear resolution.
The Chow Ring of a Classifying Space
 Proc. Symposia in Pure Math. 67
, 1999
"... For any linear algebraic group G, we define a ring CH ∗BG, the ring of characteristic classes with values in the Chow ring (that is, the ring of algebraic cycles modulo rational equivalence) for principal Gbundles over smooth algebraic varieties. We show that this coincides with the Chow ring of an ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
MU ∗BG by the ideal generated by the elements of negative degree in the coefficient ring MU ∗ = Z[x1, x2,...], that is, through the ring MU ∗BG⊗MU ∗Z. (For clarity, let us mention that the classifying space of a complex algebraic group is homotopy equivalent to that of its maximal compact subgroup.
Results 1  10
of
1,059