Sciweavers

85 search results - page 9 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
CIDM
2007
IEEE
14 years 1 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
13 years 12 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
DC
2008
13 years 7 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
ICDM
2010
IEEE
201views Data Mining» more  ICDM 2010»
13 years 5 months ago
Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
Nikolaj Tatti, Boris Cule
KAIS
2010
139views more  KAIS 2010»
13 years 6 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