Sciweavers

573 search results - page 67 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
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
IDA
2007
Springer
14 years 1 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
ICDE
2007
IEEE
169views Database» more  ICDE 2007»
14 years 2 months ago
Mining Personally Important Places from GPS Tracks
The discovery of a person’s personally important places involves obtaining the physical locations for a person’s places that matter to his daily life and routines. This proble...
Changqing Zhou, Nupur Bhatnagar, Shashi Shekhar, L...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 9 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
DAWAK
2003
Springer
14 years 1 months ago
Comprehensive Log Compression with Frequent Patterns
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
Kimmo Hätönen, Jean-François Boul...