1284 search results - page 17 / 257 » Connectivity in Bag Generation |
95
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such...
137
click to vote
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
DIMACS
2001
14 years 11 months ago
2001
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...