Sciweavers

317 search results - page 50 / 64
» A hybrid approach to mining frequent sequential patterns
Sort
View
KAIS
2010
139views more  KAIS 2010»
14 years 8 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICCV
2007
IEEE
15 years 11 months ago
Discriminative Subsequence Mining for Action Classification
Recent approaches to action classification in videos have used sparse spatio-temporal words encoding local appearance around interesting movements. Most of these approaches use a ...
Sebastian Nowozin, Gökhan H. Bakir, Koji Tsud...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
15 years 2 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
ICTAI
2008
IEEE
15 years 4 months ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang