Sciweavers

1918 search results - page 168 / 384
» Discovering Cortical Algorithms
Sort
View
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
15 years 9 months ago
oddball: Spotting Anomalies in Weighted Graphs
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
Leman Akoglu, Mary McGlohon, Christos Faloutsos
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
15 years 9 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
CIKM
1998
Springer
15 years 9 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
CIARP
2006
Springer
15 years 8 months ago
Alignment of Paragraphs in Bilingual Texts Using Bilingual Dictionaries and Dynamic Programming
Parallel text alignment is a special type of pattern recognition task aimed to discover the similarity between two sequences of symbols. Given the same text in two different langua...
Alexander F. Gelbukh, Grigori Sidorov
PKDD
2000
Springer
125views Data Mining» more  PKDD 2000»
15 years 8 months ago
Materialized Data Mining Views
Data mining is a useful decision support technique, which can be used to find trends and regularities in warehouses of corporate data. A serious problem of its practical applicatio...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...