Sciweavers

340 search results - page 62 / 68
» Clustering with Lower Bound on Similarity
Sort
View
JSS
2007
67views more  JSS 2007»
14 years 9 months ago
TFRP: An efficient microaggregation algorithm for statistical disclosure control
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
Chin-Chen Chang, Yu-Chiang Li, Wen-Hung Huang
MVA
2007
210views Computer Vision» more  MVA 2007»
14 years 11 months ago
Represent Image Contents Using Curves and Chain Code
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
Pornchai Mongkolnam, Chakarida Nukoolkit, Thanee D...
ICDE
2006
IEEE
198views Database» more  ICDE 2006»
15 years 10 months ago
Automating the Design and Construction of Query Forms
One of the simplest ways to query a database is through a form, where a user can fill in relevant information and obtain desired results by submitting the form. Designing good sta...
Magesh Jayapandian, H. V. Jagadish
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
ISBRA
2009
Springer
15 years 4 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...