Sciweavers

1492 search results - page 128 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 1 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
IADIS
2008
14 years 11 months ago
Design of an Automated System for Clustering Heterogeneous Data
The goal of this work is to study the feasibility of a Heterogeneous Data Classification and Search (HDCS) system and to provide a possible design for its implementing. In order t...
Dorin Carstoiu, Alexandra Cernian, Adriana Olteanu...
WWW
2010
ACM
15 years 5 months ago
CETR: content extraction via tag ratios
We present Content Extraction via Tag Ratios (CETR) – a method to extract content text from diverse webpages by using the HTML document’s tag ratios. We describe how to comput...
Tim Weninger, William H. Hsu, Jiawei Han
ICIP
2000
IEEE
15 years 11 months ago
Combustion Analysis by Image Processing of Premixed Flames
We describe a three-step algorithm for the analysis of color images of flames, with the objective of analyzing the combustion process and its control parameters indirectly. The al...
Gaetano Baldini, Paola Campadelli, Raffaella Lanza...
CIKM
2009
Springer
15 years 4 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...