Results 1  10
of
47,137
Web Caching and Zipflike Distributions: Evidence and Implications
 IN INFOCOM
, 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract

Cited by 1091 (2 self)
 Add to MetaCart
This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2
CURE: An Efficient Clustering Algorithm for Large Data sets
 Published in the Proceedings of the ACM SIGMOD Conference
, 1998
"... Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new clustering ..."
Abstract

Cited by 722 (5 self)
 Add to MetaCart
of random sampling and partitioning. A random sample drawn from the data set is first partitioned and each partition is partially clustered. The partial clusters are then clustered in a second pass to yield the desired clusters. Our experimental results confirm that the quality of clusters produced by CURE
SMOTE: Synthetic Minority Oversampling Technique
 Journal of Artificial Intelligence Research
, 2002
"... An approach to the construction of classifiers from imbalanced datasets is described. A dataset is imbalanced if the classification categories are not approximately equally represented. Often realworld data sets are predominately composed of ``normal'' examples with only a small percentag ..."
Abstract

Cited by 634 (27 self)
 Add to MetaCart
An approach to the construction of classifiers from imbalanced datasets is described. A dataset is imbalanced if the classification categories are not approximately equally represented. Often realworld data sets are predominately composed of ``normal'' examples with only a small
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
An extended set of Haarlike features for rapid objection detection
 IEEE ICIP
"... Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated ef ..."
Abstract

Cited by 577 (4 self)
 Add to MetaCart
Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated
Feature selection: Evaluation, application, and small sample performance
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... Abstractâ€”A large number of algorithms have been proposed for feature subset selection. Our experimental results show that the sequential forward floating selection (SFFS) algorithm, proposed by Pudil et al., dominates the other algorithms tested. We study the problem of choosing an optimal feature s ..."
Abstract

Cited by 474 (13 self)
 Add to MetaCart
set for land use classification based on SAR satellite images using four different texture models. Pooling features derived from different texture models, followed by a feature selection results in a substantial improvement in the classification accuracy. We also illustrate the dangers of using
Memory Consistency and Event Ordering in Scalable SharedMemory Multiprocessors
 In Proceedings of the 17th Annual International Symposium on Computer Architecture
, 1990
"... Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory and the f ..."
Abstract

Cited by 730 (17 self)
 Add to MetaCart
Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory
Some methods for classification and analysis of multivariate observations
 In 5th Berkeley Symposium on Mathematical Statistics and Probability
, 1967
"... The main purpose of this paper is to describe a process for partitioning an Ndimensional population into k sets on the basis of a sample. The process, which is called 'kmeans, ' appears to give partitions which are reasonably ..."
Abstract

Cited by 3055 (3 self)
 Add to MetaCart
The main purpose of this paper is to describe a process for partitioning an Ndimensional population into k sets on the basis of a sample. The process, which is called 'kmeans, ' appears to give partitions which are reasonably
On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform
 Proc. IEEE
, 1978
"... AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we subject ..."
Abstract

Cited by 668 (0 self)
 Add to MetaCart
AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we
On the Resemblance and Containment of Documents
 In Compression and Complexity of Sequences (SEQUENCESâ€™97
, 1997
"... Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection probl ..."
Abstract

Cited by 506 (6 self)
 Add to MetaCart
Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection
Results 1  10
of
47,137