176
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
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...
180
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
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...
179
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
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 ...
214
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
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...
192
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
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...
162
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
215
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
162
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
While most software defects (i.e., bugs) are corrected and tested as part of the lengthy software development cycle, enterprise software vendors often have to release software pro...
155
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
210
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...