Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
96
2006. Clustering of Polysemic Words
- In Advances in Data Analysis - 30th Annual Conference of the German Classification Society (GfKl
"... Abstract. In this paper, we propose an approach for constructing clusters of related terms that may be used for deriving formal conceptual structures in a later stage. In contrast to previous approaches in this direction, we explicitly take into account the fact that words can have different, possib ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
, possibly even unrelated, meanings. To account for such ambiguities in word meaning, we consider two alternative soft clustering techniques, namely Overlapping Pole-Based Clustering (PoBOC) and Clustering by Committees (CBC). These soft clustering algorithms are used to detect different contexts
PoBOC: an Overlapping Clustering Algorithm. Application to Rule-Based Classification and Textual Data
- In R. López de Mántaras and L. Saitta, IOS Press, editor, Proceedings of the 16th European Conference on Artificial Intelligence
"... Abstract. This paper presents the clustering algorithm PoBOC (Pole-Based Overlapping Clustering). It has two main characteristics: the number of final clusters is unknown a priori and PoBOC allows an object to belong to one or several clusters. Given a similarity matrix over a set of objects, PoBOC ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
Abstract. This paper presents the clustering algorithm PoBOC (Pole-Based Overlapping Clustering). It has two main characteristics: the number of final clusters is unknown a priori and PoBOC allows an object to belong to one or several clusters. Given a similarity matrix over a set of objects, Po
Automatic Knowledge Representation using a Graph-based Algorithm for LanguageIndependent Lexical Chaining
- In Proceedings of the Workshop on Information Extraction Beyond the Document associated to the Joint Conference of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006
, 2006
"... Lexical Chains are powerful representations of documents. In particular, they have successfully been used in the field of Automatic Text Summarization. However, until now, Lexical Chaining algorithms have only been proposed for English. In this paper, we propose a greedy Language-Independent algorit ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
-Independent algorithm that automatically extracts Lexical Chains from texts. For that purpose, we build a hierarchical lexico-semantic knowledge base from a collection of texts by using the Pole-Based Overlapping Clustering Algorithm. As a consequence, our methodology can be applied to any language and proposes a
Robust pole clustering of parametric uncertain systems using interval methods
"... In this paper a new methodology to solve the pole clustering problem for parametric uncertain systems is introduced: The problem of clustering the closed loop poles into prescribed D-regions in the complex plane is stated as a quantified constraint problem that represents bounded uncertain parame ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In this paper a new methodology to solve the pole clustering problem for parametric uncertain systems is introduced: The problem of clustering the closed loop poles into prescribed D-regions in the complex plane is stated as a quantified constraint problem that represents bounded uncertain
Sliding Mode Design via Quadratic Performance Optimization with Pole-Clustering Constraint
- SIAM J. Cont. Optim
"... Abstract. We consider a novel method for designing the sliding mode that minimizes the quadratic performance while keeping a pole-clustering constraint. Our approach is based on the manipulations of linear matrix inequalities (LMIs) imposed by the design objectives. For this purpose, we newly propos ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. We consider a novel method for designing the sliding mode that minimizes the quadratic performance while keeping a pole-clustering constraint. Our approach is based on the manipulations of linear matrix inequalities (LMIs) imposed by the design objectives. For this purpose, we newly
Improved Pade-Pole Clustering Approach using Genetic Algorithm for Model Order Reduction
"... Reducing the order of higher order systems by mixed approach is Improved Pade-Pole clustering based method to derive a reduced order approximation for a stable continuous time system is presented. In this method, the denominator polynomial of the reduced order model is derive by improved pole-cluste ..."
Abstract
- Add to MetaCart
Reducing the order of higher order systems by mixed approach is Improved Pade-Pole clustering based method to derive a reduced order approximation for a stable continuous time system is presented. In this method, the denominator polynomial of the reduced order model is derive by improved pole-clustering
RBT-Km: K-Means Clustering for Multiple Sequence Alignment
, 2008
"... * Corresponding author. 2 Abstract- This paper presents a novel approach for solving the Multiple Sequence Alignment (MSA) problem. K-Means clustering is combined with the Rubber Band Technique (RBT) to introduce an iterative optimization algorithm, known as RBT-Km, to find the optimal alignment for ..."
Abstract
- Add to MetaCart
for a set of input protein sequences. In this technique, the MSA problem is modeled as a RB, while the solution space is modeled as plate with several poles corresponding locations in the input sequences that are most likely to be correlated and/or biologically related. K-Means clustering is then used
COOL CORE BIAS IN SUNYAEV–ZEL’DOVICH GALAXY CLUSTER SURVEYS
"... Sunyaev–Zel’dovich (SZ) surveys find massive clusters of galaxies by measuring the inverse Compton scattering of cosmic microwave background off of intra-cluster gas. The cluster selection function from such surveys is expected to be nearly independent of redshift and cluster astrophysics. In this w ..."
Abstract
- Add to MetaCart
. For each cluster, we make simulated SZ observations by the South Pole Telescope and characterize the cluster selection function, but note that our results are broadly applicable to other SZ surveys. We find that the inclusion of a cool core can cause a change in the measured SPT significance of a cluster
The Radio Luminosity Function of the NEP Distant Cluster Radio Galaxies
, 2005
"... Abstract. A complete sample of 18 X-ray selected clusters of galaxies belonging to the ROSAT North Ecliptic Pole (NEP) survey has been observed with the Very Large Array at 1.4 GHz. These are the most distant clusters in the X-ray survey with redshift in the range 0.3<z<0.8. Seventy-nine radio ..."
Abstract
- Add to MetaCart
Abstract. A complete sample of 18 X-ray selected clusters of galaxies belonging to the ROSAT North Ecliptic Pole (NEP) survey has been observed with the Very Large Array at 1.4 GHz. These are the most distant clusters in the X-ray survey with redshift in the range 0.3<z<0.8. Seventy
OPTICALLY AND X-RAY SELECTED CLUSTERS OF GALAXIES IN THE XMM/2DF/SDSS SURVEY
, 2003
"... Keywords: In this work we present combined optical and X-ray cluster detection methods in an area near the North Galactic Pole area, previously covered by the SDSS and 2dF optical surveys. The same area has been covered by shallow ( ∼ 1.8 deg 2) XMM-Newton observations. The optical cluster detection ..."
Abstract
- Add to MetaCart
Keywords: In this work we present combined optical and X-ray cluster detection methods in an area near the North Galactic Pole area, previously covered by the SDSS and 2dF optical surveys. The same area has been covered by shallow ( ∼ 1.8 deg 2) XMM-Newton observations. The optical cluster
Results 1 - 10
of
96
