Sciweavers

652 search results - page 103 / 131
» Database Engineering from the Category Theory Viewpoint
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 5 days ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
11 years 10 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
WSDM
2012
ACM
296views Data Mining» more  WSDM 2012»
12 years 3 months ago
Inferring social ties across heterogenous networks
It is well known that different types of social ties have essentially different influence between people. However, users in online social networks rarely categorize their contact...
Jie Tang, Tiancheng Lou, Jon M. Kleinberg