Sciweavers

2497 search results - page 420 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
14 years 17 days ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
SAC
2009
ACM
14 years 6 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
DBA
2006
143views Database» more  DBA 2006»
14 years 17 days ago
Automated Generalization of Fuzzy Concept Hierarchies for Attribute-Oriented Induction Purposes
This paper presents an approach to produce generalization candidates for a concept hierarchy without the necessity of being an expert in the domain to be generalized and ...
Jacob Dolan, Rafal A. Angryk
TKDE
2008
178views more  TKDE 2008»
13 years 11 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
14 years 3 months ago
OPTICS-OF: Identifying Local Outliers
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...