Sciweavers

KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 5 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 5 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
KDD
2006
ACM
117views Data Mining» more  KDD 2006»
14 years 5 months ago
Efficient multidimensional data representations based on multiple correspondence analysis
In the On Line Analytical Processing (OLAP) context, exploration of huge and sparse data cubes is a tedious task which does not always lead to efficient results. In this paper, we...
Omar Boussaid, Riadh Ben Messaoud, Sabine Loudcher...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 5 months ago
A new multi-view regression approach with an application to customer wallet estimation
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
Srujana Merugu, Saharon Rosset, Claudia Perlich
KDD
2006
ACM
175views Data Mining» more  KDD 2006»
14 years 5 months ago
A mixture model for contextual text mining
Contextual text mining is concerned with extracting topical themes from a text collection with context information (e.g., time and location) and comparing/analyzing the variations...
Qiaozhu Mei, ChengXiang Zhai
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
14 years 5 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 5 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 5 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 5 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...