178 search results - page 27 / 36 » A Practical Algorithm to Find the Best Episode Patterns |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...