1314 search results - page 40 / 263 » Approximate data mining in very large relational data |
105
Voted
DASFAA
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we propose a novel data mining scheme to explore the frequent hierarchical structure patterns, named tree-like patterns, with the relationship of each item on a sequ...
107
click to vote
IV
2010
IEEE
15 years 23 hour ago
2010
IEEE
We represent time-varying data as polyline charts very often. At the same time, we often need to observe hundreds or even thousands of time-varying values in one chart. However, i...
140
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
133
click to vote
NIPS
1998
15 years 2 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
136
click to vote
OSDI
2004
ACM
16 years 1 months ago
2004
ACM
Copy-pasted code is very common in large software because programmers prefer reusing code via copy-paste in order to reduce programming effort. Recent studies show that copy-paste...