• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4030
  • 1194
  • 508
  • 267
  • 200
  • 119
  • 91
  • 45
  • 45
  • 45
  • 45
  • 45
  • 45
  • 43
  • 34
  • Tagged with
  • 8124
  • 2353
  • 1599
  • 1091
  • 1068
  • 1040
  • 1007
  • 957
  • 896
  • 896
  • 821
  • 770
  • 710
  • 519
  • 496
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

Extending the metric multidimensional scaling with bregman divergences

Sun, Jiang January 2010 (has links)
No description available.
32

Flexgraph: flexible subgraph search in large graphs

Yuan, Wenjun., 袁文俊. January 2010 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
33

Overlapping clustering

Krumpelman, Chase Serhur 13 December 2010 (has links)
Analysis of large collections of data has become inescapable in many areas of scientific and commercial endeavor. As the size and dimensionality of these collections exceed the pattern recognition capability of the human mind computational analysis tools become a necessity for interpretation. Clustering algorithms, which aim to find interesting groupings within collections of data, are one such tool. Each algorithm incorporates into its design an inherent definition of “interesting” intended to capture nonrandom data groupings likely to have some interpretation to human users. Most existing algorithms include as part of their definition of “interesting” an assumption that each data point can belong at most to one grouping. While this assumption allows for algorithmic convenience and ease of analysis, it is often an artificial imposition on true underlying data structure. The idea of allowing points to belong to multiple groupings - known as “overlapping” or “multiple membership” clustering - has emerged in several domains in ad hoc solutions lacking conceptual unity in approach, interpretation, and analysis. This dissertation proposes general, domain-independent elucidations and practical techniques which address each of these. We begin by positing overlapping clustering’s role specifically, and clustering’s role in general, as assistive technologic tools allowing human minds to represent and interpret structures in data beyond the capability of our innate senses. With this guiding purpose clarified, we provide a catalog of existing techniques. We then address the issue of objectively comparing the results of different algorithms, specifically examining the previously defined Omega index, as well as multiple membership generalizations of normalized mutual information. Following that comparison, we propose a novel approach to com- paring clusterings called cluster alignment. By combining a sorting algorithm with a greedy matching algorithm, we produce comparably organized membership matrices and a means for both numerically and visually comparing multiple-membership assignments. With overlapping clustering’s purpose defined, and the means to analyze results, we move on to presenting algorithms for efficiently discovering overlapping clusters in data. First, we present a generalization of one of the common themes in the ad hoc approaches: additive clustering. Starting with a previously developed structural model of additive clustering, we generalize it to be applicable to any regular exponential family distribution thereby extending its utility into several domains, notably high-dimensional sparse domains including text and recommender systems. Finally, we address overlapping clustering by examining the properties of data in similarity spaces. We develop a probabilistic generative model of overlapping data in similarity spaces, and then develop two conceptual approaches to discovering overlapping clustering in similarity spaces. The first of these is the conceptual multiple-membership generalization of hierarchical agglomerative clustering, and the second is an iterative density hill-climbing algorithm. / text
34

A K-seed genetic clustering algorithm with applications to cellular manufacturing

Elisha, Karl Justin Edward January 1997 (has links)
No description available.
35

Parallel simulations using recurrence relations and relaxation

McGough, Andrew Stephen January 2000 (has links)
This thesis develops and evaluates a number of efficient algorithms for performing parallel simulations. These algorithms achieve approximate linear speed-up, in the sense that their run times are in the order of O(n/p), when n is the size of the problem and p is the number of processors employed. The systems that are being simulated are related to ATM switches and sliding window communication protocols. The algorithms presented first are concern with the parallel generation and merging of bursty arrival sources, marking and deleting of lost cells due to buffer overflows and computation of departure instants. They work well on shared memory multiprocessors. However, different techniques need to be emulated in order to achieve similar speed-ups on a distributed cluster of workstations. The main obstacle is the inter-process communication overhead. To overcome it, new algorithms are developed that reduce considerably the amount of information transferred between processors. They are applied both to the ATM switch and to the sliding window protocol with feedbacks. In all cases, the methodology relies in reducing the simulation task to a set of recurrence relations. The latter are solved using the techniques of parallel prefix computation, parallel merging and relaxing. The effectiveness of these algorithms is evaluated by comparing their run times with that of an optimized sequential algorithm. A number of experiments are carried out on a 12-processor shared memory system, and also on a distributed cluster of 12 processors connected by a fast Ethernet.
36

The modification of internal representations as a mechanism for learning in neural systems

Wren, Kangda January 2001 (has links)
No description available.
37

An efficient collision detection algorithm for polytopes in virtual environments

鍾達良, Chung, Tat-leung, Kelvin. January 1996 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
38

Geometric object reconstruction from orthogonal ray sum data

林吉雄, Lam, Kat-hung. January 1993 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
39

Efficient stabbing algorithms for a set of objects

王富利, Wang, Fu-lee. January 1999 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
40

The power of greediness: a general methodology for designing approximation algorithms

劉興業, Lau, Hing-yip. January 1999 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy

Page generated in 0.0598 seconds