Discovering Frequent Graph Patterns Using Disjoint Paths

Artículos similares

Discovering Frequent Generalized Episodes When Events Persist for Different Durations

Acceso

Laxman, S.; Sastry, P.S.; Unnikrishnan, K.P. Pág. 1188 - 1201

Revista: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

Discovering Frequent Closed Partial Orders from Strings

Acceso

Jian Pei; Haixun Wang; Jian Liu; Ke Wang; Jianyong Wang; Yu, P.S. Pág. 1467 - 1481

Revista: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set

Acceso

Lin, D.-I. Kedem, Z. M. Pág. 553 - 566

Revista: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences

Acceso

Bettini, C; Wang, X S; Jajodia, S; Lin, J-L Pág. 222 - 237

Revista: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

Facing up to the Plurality of Goals, Methods, Needs and Resources in HCI

Acceso

Stephen Draper

Most analyses of how humans use artifacts, and interactive software in particular, have a strong tendency to assign 1:1 correspondences between goals and methods: to see software as supporting one task, users as having one way of executing a task, one th... ver más

Revista: Australasian Journal of Information Systems

Artículos similares

Revistas destacadas