The Experts below are selected from a list of 112509 Experts worldwide ranked by ideXlab platform
Stephen Kwek - One of the best experts on this subject based on the ideXlab platform.
-
on learning unions of Pattern languages and tree Patterns in the mistake bound model
Algorithmic Learning Theory, 2002Co-Authors: Sally A Goldman, Stephen KwekAbstract:We present efficient on-line algorithms for learning unions of a constant number of tree Patterns, unions of a constant number of one-Variable Pattern languages, and unions of a constant number of Pattern languages with fixed length substitutions. By fixed length substitutions we mean that each occurrence of Variable xi must be substituted by terminal strings of fixed length l(xi). We prove that if arbitrary unions of Pattern languages with fixed length substitutions can be learned efficiently then DNFs are efficiently learnable in the mistake bound model. Since we use a reduction to Winnow, our algorithms are robust against attribute noise. Furthermore, they can be modified to handle concept drift. Also, our approach is quite general and we give results to learn a class that generalizes Pattern languages.
-
on learning unions of Pattern languages and tree Patterns
Algorithmic Learning Theory, 1999Co-Authors: Sally A Goldman, Stephen KwekAbstract:We present efficient on-line algorithms for learning unions of a constant number of tree Patterns, unions of a constant number of one-Variable Pattern languages, and unions of a constant number of Pattern languages with fixed length substitutions. By fixed length substitutions we mean that each occurence of Variable xi must be substituted by terminal strings of fixed length l(xi). We prove that if an arbitrary unions of Pattern languages with fixed length substitutions can be learned efficiently then DNFs are efficiently learnable in the mistake bound model. Since we use a reduction to Winnow, our algorithms are robust against attribute noise. Furthermore, they can be modified to handle concept drift. Also, our approach is quite general and may be applicable to learning other Pattern related classes. For example, we could learn a more general Pattern language class in which a penalty (i.e. weight) is assigned to each violation of the rule that a terminal symbol cannot be changed or that a pair of Variable symbols, of the same Variable, must be substituted by the same terminal string. An instance is positive iff the penalty incurred for violating these rules is below a given tolerable threshold.
Gaëlle Quereux - One of the best experts on this subject based on the ideXlab platform.
-
Efficacy and tolerance of photodynamic therapy for vulvar Paget's disease: a multicentric retrospective study
European Journal of Dermatology, 2018Co-Authors: Diane-iris Rioli, Mahtab Samimi, Nathalie Beneton, Ewa Hainaut, Ludovic Martin, Laurent Misery, Gaëlle QuereuxAbstract:BACKGROUND: Extra-mammary Paget's disease is a rare form of intraepithelial adenocarcinoma with a Variable Pattern of invasion, sometimes associated with distant malignancy. Vulvar Paget's disease (VPD) represents 1% of all vulvar cancers. Standard treatment is surgical excision, however, the recurrence rate is high and surgery leads to anatomical, functional, and sexual morbidity. Some case series suggest efficacy of photodynamic (PDT) as treatment for this indication. OBJECTIVES: Our aim was to assess the efficacy and tolerance of PDT in women suffering from VPD. MATERIALS & METHODS: A retrospective study was conducted on all patients suffering from VPD, treated with PDT at six hospitals in France. Clinical data, histopathological reports at diagnosis, therapeutic history, PDT schedule, tolerance, and clinical response were reported. RESULTS: Thirteen women were included, with a mean age of 70.1 years. Ten women had an in situ disease, two had <1-mm dermal involvement, and one had adnexal involvement. All PDT courses were carried out using the same light source and photosensitizing agent. Complete response was achieved in two patients (15%) and partial response in five patients (38%). Five patients (38%) had stable disease and one (7%) had progressive disease. Ten of the 13 patients underwent pain evaluation; in six cases (60%), pain was described as moderate to intense. CONCLUSION: PDT appears to be a therapeutic option for patients with VPD, with a response rate similar to that of other therapies usually recommended, such as surgery and imiquimod. There is a need to harmonise PDT procedures and pain assessment.
Sally A Goldman - One of the best experts on this subject based on the ideXlab platform.
-
on learning unions of Pattern languages and tree Patterns in the mistake bound model
Algorithmic Learning Theory, 2002Co-Authors: Sally A Goldman, Stephen KwekAbstract:We present efficient on-line algorithms for learning unions of a constant number of tree Patterns, unions of a constant number of one-Variable Pattern languages, and unions of a constant number of Pattern languages with fixed length substitutions. By fixed length substitutions we mean that each occurrence of Variable xi must be substituted by terminal strings of fixed length l(xi). We prove that if arbitrary unions of Pattern languages with fixed length substitutions can be learned efficiently then DNFs are efficiently learnable in the mistake bound model. Since we use a reduction to Winnow, our algorithms are robust against attribute noise. Furthermore, they can be modified to handle concept drift. Also, our approach is quite general and we give results to learn a class that generalizes Pattern languages.
-
on learning unions of Pattern languages and tree Patterns
Algorithmic Learning Theory, 1999Co-Authors: Sally A Goldman, Stephen KwekAbstract:We present efficient on-line algorithms for learning unions of a constant number of tree Patterns, unions of a constant number of one-Variable Pattern languages, and unions of a constant number of Pattern languages with fixed length substitutions. By fixed length substitutions we mean that each occurence of Variable xi must be substituted by terminal strings of fixed length l(xi). We prove that if an arbitrary unions of Pattern languages with fixed length substitutions can be learned efficiently then DNFs are efficiently learnable in the mistake bound model. Since we use a reduction to Winnow, our algorithms are robust against attribute noise. Furthermore, they can be modified to handle concept drift. Also, our approach is quite general and may be applicable to learning other Pattern related classes. For example, we could learn a more general Pattern language class in which a penalty (i.e. weight) is assigned to each violation of the rule that a terminal symbol cannot be changed or that a pair of Variable symbols, of the same Variable, must be substituted by the same terminal string. An instance is positive iff the penalty incurred for violating these rules is below a given tolerable threshold.
Manoranjan Paul - One of the best experts on this subject based on the ideXlab platform.
-
A Low Bit-Rate Video-Coding Algorithm Based Upon Variable Pattern Selection
2016Co-Authors: Manoranjan Paul, Manzur Murshed, Laurence DooleyAbstract:Recent research into Pattern representation of moving regions in blocked-based motion estimation and compensation in video sequences, has focused mainly upon using a fixed number of regular shaped Patterns. These are used to match the macroblocks in a frame that have two distinct regions involving static background and moving objects. In this paper a new Variable Pattern Selection (VPS) algorithm is presented which selects a preset number of best-matched Patterns from a Pattern codebook of regular shaped Patterns. While more Patterns are used than in the previous work, the performance of the VPS algorithm in using Variable length coding, by exploiting the frequency of the best-matched Patterns, leads to a higher compression ratio, without degrading the overall image quality. Keywords—Motion estimation and compensation, low bit-rate video coding, moving region detection, Pattern matching.
-
a real time generic Variable Pattern selection algorithm for very low bit rate video coding
International Conference on Image Processing, 2003Co-Authors: Manoranjan Paul, Manzur Murshed, Laurence S DooleyAbstract:The selection of an optimal regular-shaped Pattern set for very low bit-rate video coding, focusing on moving regions has been the objective of much recent research in order to try and improve bit-rate efficiency. Selecting the optimal Pattern set however, is an NP hard problem. This paper presents a generic Variable Pattern selection (GVPS) algorithm, which introduces a Pattern selection parameter that is able to control the performance in terms of computational complexity as well as bit-rate and picture quality. While using a sub-optimal Variable Pattern set, GVPS obtains a coding performance comparable to near-optimal algorithms, such as the k-change neighbourhood solution, while being much less computationally intensive, so that it is able to process all types of video sequences in real-time, with minimal pre-processing overheads.
Diane-iris Rioli - One of the best experts on this subject based on the ideXlab platform.
-
Efficacy and tolerance of photodynamic therapy for vulvar Paget's disease: a multicentric retrospective study
European Journal of Dermatology, 2018Co-Authors: Diane-iris Rioli, Mahtab Samimi, Nathalie Beneton, Ewa Hainaut, Ludovic Martin, Laurent Misery, Gaëlle QuereuxAbstract:BACKGROUND: Extra-mammary Paget's disease is a rare form of intraepithelial adenocarcinoma with a Variable Pattern of invasion, sometimes associated with distant malignancy. Vulvar Paget's disease (VPD) represents 1% of all vulvar cancers. Standard treatment is surgical excision, however, the recurrence rate is high and surgery leads to anatomical, functional, and sexual morbidity. Some case series suggest efficacy of photodynamic (PDT) as treatment for this indication. OBJECTIVES: Our aim was to assess the efficacy and tolerance of PDT in women suffering from VPD. MATERIALS & METHODS: A retrospective study was conducted on all patients suffering from VPD, treated with PDT at six hospitals in France. Clinical data, histopathological reports at diagnosis, therapeutic history, PDT schedule, tolerance, and clinical response were reported. RESULTS: Thirteen women were included, with a mean age of 70.1 years. Ten women had an in situ disease, two had <1-mm dermal involvement, and one had adnexal involvement. All PDT courses were carried out using the same light source and photosensitizing agent. Complete response was achieved in two patients (15%) and partial response in five patients (38%). Five patients (38%) had stable disease and one (7%) had progressive disease. Ten of the 13 patients underwent pain evaluation; in six cases (60%), pain was described as moderate to intense. CONCLUSION: PDT appears to be a therapeutic option for patients with VPD, with a response rate similar to that of other therapies usually recommended, such as surgery and imiquimod. There is a need to harmonise PDT procedures and pain assessment.
