240 research outputs found
Privacy Preserving Multi-Server k-means Computation over Horizontally Partitioned Data
The k-means clustering is one of the most popular clustering algorithms in
data mining. Recently a lot of research has been concentrated on the algorithm
when the dataset is divided into multiple parties or when the dataset is too
large to be handled by the data owner. In the latter case, usually some servers
are hired to perform the task of clustering. The dataset is divided by the data
owner among the servers who together perform the k-means and return the cluster
labels to the owner. The major challenge in this method is to prevent the
servers from gaining substantial information about the actual data of the
owner. Several algorithms have been designed in the past that provide
cryptographic solutions to perform privacy preserving k-means. We provide a new
method to perform k-means over a large set using multiple servers. Our
technique avoids heavy cryptographic computations and instead we use a simple
randomization technique to preserve the privacy of the data. The k-means
computed has exactly the same efficiency and accuracy as the k-means computed
over the original dataset without any randomization. We argue that our
algorithm is secure against honest but curious and passive adversary.Comment: 19 pages, 4 tables. International Conference on Information Systems
Security. Springer, Cham, 201
Hyperplasie canalaire atypique sur biopsies à l’aiguille : améliorer le diagnostic histologique
Fast 2D/3D object representation with growing neural gas
This work presents the design of a real-time system to model visual objects with the use of self-organising networks. The architecture of the system addresses multiple computer vision tasks such as image segmentation, optimal parameter estimation and object representation. We first develop a framework for building non-rigid shapes using the growth mechanism of the self-organising maps, and then we define an optimal number of nodes without overfitting or underfitting the network based on the knowledge obtained from information-theoretic considerations. We present experimental results for hands and faces, and we quantitatively evaluate the matching capabilities of the proposed method with the topographic product. The proposed method is easily extensible to 3D objects, as it offers similar features for efficient mesh reconstruction
Regularity Properties and Pathologies of Position-Space Renormalization-Group Transformations
We reconsider the conceptual foundations of the renormalization-group (RG)
formalism, and prove some rigorous theorems on the regularity properties and
possible pathologies of the RG map. Regarding regularity, we show that the RG
map, defined on a suitable space of interactions (= formal Hamiltonians), is
always single-valued and Lipschitz continuous on its domain of definition. This
rules out a recently proposed scenario for the RG description of first-order
phase transitions. On the pathological side, we make rigorous some arguments of
Griffiths, Pearce and Israel, and prove in several cases that the renormalized
measure is not a Gibbs measure for any reasonable interaction. This means that
the RG map is ill-defined, and that the conventional RG description of
first-order phase transitions is not universally valid. For decimation or
Kadanoff transformations applied to the Ising model in dimension ,
these pathologies occur in a full neighborhood of the low-temperature part of the first-order
phase-transition surface. For block-averaging transformations applied to the
Ising model in dimension , the pathologies occur at low temperatures
for arbitrary magnetic-field strength. Pathologies may also occur in the
critical region for Ising models in dimension . We discuss in detail
the distinction between Gibbsian and non-Gibbsian measures, and give a rather
complete catalogue of the known examples. Finally, we discuss the heuristic and
numerical evidence on RG pathologies in the light of our rigorous theorems.Comment: 273 pages including 14 figures, Postscript, See also
ftp.scri.fsu.edu:hep-lat/papers/9210/9210032.ps.
Prognostic value of p53 gene mutations in a large series of node- negative breast cancer patients
The most important subgroup of breast cancer patients for which reliable prognostic factors are needed are women without axillary lymph node involvement. Although overall, these patients have a good prognosis, it is known that 20-30% will experience a recurrence of the disease. To determine the prognostic significance of P53 tumor suppressor gene mutation, specimens from 113 primary breast cancers were evaluated for the presence of P53 alterations, as detected by cDNA sequencing of the entire coding sequence of the gene. The median follow-up for patients was 105 months. P53 gene mutation was an independent prognostic marker of early relapse and death. Our results suggest that P53 gene mutations could be an important factor to identify node-negative patients who have a poor prognosis in the absence of adjuvant therapy. Prospective studies should be designed to determine which therapy should be performed in this subgroup of patients
36 – Valeur pronostique des micrométastases des ganglions sentinelles : étude de cohorte multicentrique française de plus de 7 000 cas
- …