Results 1  10
of
6,249
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Novel methods improve prediction of species’ distributions from occurrence data
 Ecography
, 2006
"... occurrence data ..."
Miroslav Kirov
"... The incorporation of an unnatural amino acid to study the nucleotide binding domain of the ABC transporter HlyB from Escherichia coli ..."
Abstract
 Add to MetaCart
The incorporation of an unnatural amino acid to study the nucleotide binding domain of the ABC transporter HlyB from Escherichia coli
Enterprise restructuring in transition: A quantitative survey, Washington: The World Bank (mimeographed
, 2000
"... NOTE: We will make final revisions to this paper in July 2000, at which time we will make reference to all pertinent papers that have come to our attention by June 30, 2000. If anyone reading this survey knows of a pertinent paper not presently included in the list of references, please send a copy ..."
Abstract

Cited by 359 (10 self)
 Add to MetaCart
NOTE: We will make final revisions to this paper in July 2000, at which time we will make reference to all pertinent papers that have come to our attention by June 30, 2000. If anyone reading this survey knows of a pertinent paper not presently included in the list of references, please send a copy
Reviewed by Miroslav Repick´y References
"... Entire functions mapping uncountable dense sets of reals onto each other monotonically. (English summary) Trans. Amer. Math. Soc. 361 (2009), no. 6, 2871–2911. The main result of the paper states that if ZFC is consistent, then so is ZFC + 2 ℵ0 = ℵ2 + the following two statements: (1) Every second c ..."
Abstract
 Add to MetaCart
category set in R has a second category subset of cardinality ℵ1. (2) If 〈Aα: α < ω1 〉 and 〈Bα: α < ω1 〉 consist of pairwise disjoint dense subsets of R, Aα and Bα are countable for α < ω and Aα and Bα are everywhere second category sets of cardinality ℵ1 for ω ≤ α < ω1, and if ε: R → R is a
Reviewed by Miroslav Repick´y References
"... A set A is everywhere second category if it has second category intersection with every open set. The author proves that it is relatively consistent with ZFC that for any everywhere second category set A ⊆ R n+1 there is a function f: R n → R which is the restriction of an entire function on C n suc ..."
Abstract
 Add to MetaCart
A set A is everywhere second category if it has second category intersection with every open set. The author proves that it is relatively consistent with ZFC that for any everywhere second category set A ⊆ R n+1 there is a function f: R n → R which is the restriction of an entire function on C n
Induction of Selective Bayesian Classifiers
 CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE
, 1994
"... In this paper, we examine previous work on the naive Bayesian classifier and review its limitations, which include a sensitivity to correlated features. We respond to this problem by embedding the naive Bayesian induction scheme within an algorithm that carries out a greedy search through the space ..."
Abstract

Cited by 262 (7 self)
 Add to MetaCart
In this paper, we examine previous work on the naive Bayesian classifier and review its limitations, which include a sensitivity to correlated features. We respond to this problem by embedding the naive Bayesian induction scheme within an algorithm that carries out a greedy search through the space
Tracking the best expert
 In Proceedings of the 12th International Conference on Machine Learning
, 1995
"... Abstract. We generalize the recent relative loss bounds for online algorithms where the additional loss of the algorithm on the whole sequence of examples over the loss of the best expert is bounded. The generalization allows the sequence to be partitioned into segments, and the goal is to bound th ..."
Abstract

Cited by 246 (20 self)
 Add to MetaCart
, where n is the number of experts and the constant of proportionality depends on the loss function. Our algorithms do not produce the best partition; however the loss bound shows that our predictions are close to those of the best partition. When the number of segments is k +1and the sequence
Addressing the Curse of Imbalanced Training Sets: OneSided Selection
 In Proceedings of the Fourteenth International Conference on Machine Learning
, 1997
"... Adding examples of the majority class to the training set can have a detrimental effect on the learner's behavior: noisy or otherwise unreliable examples from the majority class can overwhelm the minority class. The paper discusses criteria to evaluate the utility of classifiers induced f ..."
Abstract

Cited by 229 (1 self)
 Add to MetaCart
from such imbalanced training sets, gives explanation of the poor behavior of some learners under these circumstances, and suggests as a solution a simple technique called onesided selection of examples. 1 Introduction The general topic of this paper is learning from examples described by pairs
Results 1  10
of
6,249