1314 search results - page 58 / 263 » Approximate data mining in very large relational data |
168
Voted
TKDE
2012
13 years 4 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
KDD
2009
ACM
15 years 8 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
PAKDD
2009
ACM
15 years 8 months ago
2009
ACM
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
123
click to vote
JCIT
2010
14 years 8 months ago
2010
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
150
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...