Sciweavers

2326 search results - page 45 / 466
» Discovering significant patterns
Sort
View
ERCIMDL
2008
Springer
107views Education» more  ERCIMDL 2008»
13 years 11 months ago
Revisiting Lexical Signatures to (Re-)Discover Web Pages
A lexical signature (LS) is a small set of terms derived from a document that capture the "aboutness" of that document. A LS generated from a web page can be used to disc...
Martin Klein, Michael L. Nelson
IS
2007
13 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ICSE
2009
IEEE-ACM
14 years 10 months ago
Discovering and representing systematic code changes
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...
Miryung Kim, David Notkin
AAAI
2007
14 years 6 days ago
Discovering Multivariate Motifs using Subsequence Density Estimation and Greedy Mixture Learning
The problem of locating motifs in real-valued, multivariate time series data involves the discovery of sets of recurring patterns embedded in the time series. Each set is composed...
David Minnen, Charles Lee Isbell Jr., Irfan A. Ess...
DMIN
2006
137views Data Mining» more  DMIN 2006»
13 years 11 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai