Sciweavers

299 search results - page 30 / 60
» Implicit Enumeration of Patterns
Sort
View
ISMIS
2009
Springer
14 years 4 months ago
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Fran&cc...
DIS
2007
Springer
14 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
13 years 11 months ago
A Test Paradigm for Detecting Changes in Transactional Data Streams
A pattern is considered useful if it can be used to help a person to achieve his goal. Mining data streams for useful patterns is important in many applications. However, data stre...
Willie Ng, Manoranjan Dash
MCS
2010
Springer
13 years 12 months ago
Tomographic Considerations in Ensemble Bias/Variance Decomposition
Abstract. Classifier decision fusion has been shown to act in a manner analogous to the back-projection of Radon transformations when individual classifier feature sets are non o...
David Windridge
MFCS
2004
Springer
14 years 3 months ago
A Generalization of Repetition Threshold
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
Lucian Ilie, Pascal Ochem, Jeffrey Shallit