1913 search results - page 246 / 383 » Using Data Mining in MURA Graphic Problems |
128
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
124
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
124
click to vote
SI3D
1997
ACM
15 years 8 months ago
1997
ACM
The requirement to change scale frequently is common to many 2D and 3D applications. Users must “zoom in” to examine details and “zoom out” to appreciate the context. This...
145
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Automated detection of the first document reporting each new event in temporally-sequenced streams of documents is an open challenge. In this paper we propose a new approach which...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...