Sciweavers

499 search results - page 95 / 100
» PRICES: An Efficient Algorithm for Mining Association Rules
Sort
View
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
WWW
2007
ACM
14 years 8 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 8 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
ICIP
2010
IEEE
13 years 5 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
FLAIRS
2010
13 years 10 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...