Sciweavers

1347 search results - page 206 / 270
» Using Clustering Methods for Discovering Event Structures
Sort
View
151
Voted
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 7 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
158
Voted
ERSHOV
2009
Springer
15 years 6 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
116
Voted
DMKD
2004
ACM
139views Data Mining» more  DMKD 2004»
15 years 8 months ago
Iterative record linkage for cleaning and integration
Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multipl...
Indrajit Bhattacharya, Lise Getoor
150
Voted
WWW
2008
ACM
16 years 3 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev
134
Voted
ISBI
2011
IEEE
14 years 6 months ago
Principal components regression: Multivariate, gene-based tests in imaging genomics
In imaging genomics, there have been rapid advances in genome-wide, image-wide searches for genes that influence brain structure. Most efforts focus on univariate tests that treat...
Derrek P. Hibar, Jason L. Stein, Omid Kohannim, Ne...