• No results found

[PDF] Top 20 Fitting Convex Sets to Data: Algorithms and Applications

Has 10000 "Fitting Convex Sets to Data: Algorithms and Applications" found on our website. Below are the top 20 most common "Fitting Convex Sets to Data: Algorithms and Applications".

Fitting Convex Sets to Data: Algorithms and Applications

Fitting Convex Sets to Data: Algorithms and Applications

... a convex optimization instance, and it exploits latent low-dimensional structure that is frequently found in signals encountered in ...the data, or it may be learned from data using the ideas from ... See full document

193

Algorithms and Applications for Spatial Data Mining

Algorithms and Applications for Spatial Data Mining

... example applications are discussed for these ...Spatial Data Mining Our framework for spatial data mining is based on spatial neighbourhood relations between ob- jects and on the induced ... See full document

32

Some Improvements of Fuzzy Clustering Algorithms Using Picture Fuzzy Sets and Applications For Geographic Data Clustering

Some Improvements of Fuzzy Clustering Algorithms Using Picture Fuzzy Sets and Applications For Geographic Data Clustering

... big data using picture fuzzy sets; design a novel method called DPFCM to reduce communication cost using the facilitator model (instead of the peer-to-peer model) and the picture fuzzy ... See full document

7

Authors. Data Clustering: Algorithms and Applications

Authors. Data Clustering: Algorithms and Applications

... By integrating density-based, grid-based, and subspace clustering, CLIQUE discovers clusters embedded in subspaces of high dimensional data without requiring users to select subspaces of interest. The DNF ... See full document

29

Applications of Data Mining Algorithms for Network

Applications of Data Mining Algorithms for Network

... two studies proposed a sequential pattern mining technique that incorporated alert information. 327[r] ... See full document

16

Compaction Algorithms for Non-Convex Polygons and Their Applications

Compaction Algorithms for Non-Convex Polygons and Their Applications

... Remark 4.1 Actually, manufacturers would not mind if the polygons \leap-fogged" over each other on the way to a more compact layout. The mixed integer programming gener- alization of this optimization model (see Chapter ... See full document

159

Efficient Algorithms and Data Structures for Massive Data Sets

Efficient Algorithms and Data Structures for Massive Data Sets

... 4. Delete(S, x): Delete element x from S 5. Delete(S, k): Delete the element with key k from S Algorithmic applications of priority queues abound [4, 25]. Soft heap is an approximate meldable priority queue ... See full document

144

Partitioning clustering algorithms for protein sequence data sets

Partitioning clustering algorithms for protein sequence data sets

... these data into functional groups or families, clustering, has become one of the principal research objectives in structural and functional ...few applications have been found in the field of protein ... See full document

11

Extracting Algorithms by Indexing and Mining Large Data Sets

Extracting Algorithms by Indexing and Mining Large Data Sets

... VI. FUTURE WORK Future work would be the semantic analysis of algorithms, their trends, and how algorithms influence each other over time. Such analyses would give rise to multiple applications that ... See full document

7

Similarity Search: Algorithms for Sets and other High Dimensional Data

Similarity Search: Algorithms for Sets and other High Dimensional Data

... whether data structures existed for (c, r)-Approximate Near Neighbour with Las Vegas guarantees, and per- formance matching that of Locality Sensitive ...the data structure is entirely pointless. This means ... See full document

158

Fitting Tractable Convex Sets to Support Function Evaluations

Fitting Tractable Convex Sets to Support Function Evaluations

... compact convex set from evaluations of its support function arises in a range of scientific and engineering ...compact convex sets; in particular, these methods do not allow for the incorporation of ... See full document

35

Iterative algorithms for common elements in fixed point sets and zero point sets with applications

Iterative algorithms for common elements in fixed point sets and zero point sets with applications

... The class of strictly pseudocontractive mappings was introduced by Browder and Petryshyn [16]. If = 0, the class of strictly pseudocontractive mappings is reduced to the class of nonexpansive mappings. In case that = 1, ... See full document

14

Locating Multiple Facilities in Convex Sets with Fuzzy Data and Block Norms

Locating Multiple Facilities in Convex Sets with Fuzzy Data and Block Norms

... We use this results for the problem with fuzzy data. We also do this for rectilinear and infinity norms as special cases of block norms. Rectilinear distances have been taken as the scenario may be thought of in ... See full document

9

Using evolutionary algorithms for fitting high dimensional models to neuronal data

Using evolutionary algorithms for fitting high dimensional models to neuronal data

... show sets of tuning curves for four sample neurons to illustrate some of the characteristic behaviours that can be ...the data in an attempt to capture all of these tun- ing characteristics in individual ... See full document

20

Fitting Clearing Functions to Empirical Data: Simulation Optimization and Heuristic Algorithms.

Fitting Clearing Functions to Empirical Data: Simulation Optimization and Heuristic Algorithms.

... machine 3, the data is spread over the area. Figure 3-6 shows the plot for machine 7, another unreliable machine, which is very similar to that for machine 3. Figure 3-8 shows the plot of machine 4, which is our ... See full document

176

Tractable fitting with convex polynomials via sum-of-squares

Tractable fitting with convex polynomials via sum-of-squares

... of fitting given data (u 1 , y 1 ), ...a convex polynomial ...the convex hull of a set of points with a convex sub-level set of a polynomial is ... See full document

6

Accurate and efficient clustering algorithms for very large data sets

Accurate and efficient clustering algorithms for very large data sets

... size data sets. All data sets contain only numeric attributes and they do not contain missing ...of data sets, then present ...following algorithms are used for ... See full document

152

Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets

Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets

... properties is that calculating an upper bound for this measure based on IP S and OP S can be done by solving a number of LP-problems when using dummy points. To explain the general idea behind these dummy points and the ... See full document

39

Convex sets and inequalities

Convex sets and inequalities

... 1. Concept and fundamental result Given a natural correspondence between a family of inequalities and a closed convex set in a topological linear space, one might expect that an inequality corresponding to a ... See full document

11

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

... any convex set by a symmetric set; the distance to a symmetric set can be considered a measure of its symmetry ...planar convex body C lies between two homothetic ellipses E ⊂ C ⊂ 2E with homothety ratio at ... See full document

13

Show all 10000 documents...