Sciweavers

7053 search results - page 1237 / 1411
» Data Mining of Multi-categorized Data
Sort
View
TODS
2002
92views more  TODS 2002»
15 years 5 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
MTA
2007
101views more  MTA 2007»
15 years 5 months ago
Finding maximum-length repeating patterns in music databases
Abstract This paper introduces the problem of discovering maximum-length repeating patterns in music objects. A novel algorithm is presented for the extraction of this kind of patt...
Ioannis Karydis, Alexandros Nanopoulos, Yannis Man...
PPL
2007
126views more  PPL 2007»
15 years 5 months ago
Challenges in Parallel Graph Processing
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickso...
IAJIT
2010
81views more  IAJIT 2010»
15 years 4 months ago
Credit Scoring Models Using Soft Computing Methods: A Survey
: During the last fifteen years, soft computing methods have been successfully applied in building powerful and flexible credit scoring models and have been suggested to be a possi...
Adel Lahsasna, Raja Noor Ainon, Teh Ying Wah
IEICET
2010
132views more  IEICET 2010»
15 years 4 months ago
Direct Importance Estimation with a Mixture of Probabilistic Principal Component Analyzers
Estimating the ratio of two probability density functions (a.k.a. the importance) has recently gathered a great deal of attention since importance estimators can be used for solvi...
Makoto Yamada, Masashi Sugiyama, Gordon Wichern, J...
« Prev « First page 1237 / 1411 Last » Next »