131 |
Personalized web search re-ranking and content recommendationJiang, Hao, 江浩 January 2013 (has links)
In this thesis, I propose a method for establishing a personalized recommendation system for re-ranking web search results and recommending web contents. The method is based on personal reading interest which can be reflected by the user’s dwell time on each document or webpage. I acquire document-level dwell times via a customized web browser, or a mobile device. To obtain better precision, I also explore the possibility of tracking gaze position and facial expression, from which I can determine the attractiveness of different parts of a document.
Inspired by idea of Google Knowledge Graph, I also establish a graph-based ontology to maintain a user profile to describe the user’s personal reading interest. Each node in the graph is a concept, which represents the user’s potential interest on this concept. I also use the dwell time to measure concept-level interest, which can be inferred from document-level user dwell times. The graph is generated based on the Wikipedia. According to the estimated concept-level user interest, my algorithm can estimate a user’s potential dwell time over a new document, based on which personalized webpage re-ranking can be carried out. I compare the rankings produced by my algorithm with rankings generated by popular commercial search engines and a recently proposed personalized ranking algorithm. The results clearly show the superiority of my method.
I also use my personalized recommendation framework in other applications. A good example is personalized document summarization. The same knowledge graph is employed to estimate the weight of every word in a document; combining with a traditional document summarization algorithm which focused on text mining, I could generate a personalized summary which emphasize the user’s interest in the document. To deal with images and videos, I present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consists of online images and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are used to estimate individual reference images’ relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of my method lies in its ability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, my algorithm infers the relevance of an online search result image to a text query. Once I estimate a query relevance score for each online image search result, I can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of my algorithm, I tested it both on a standard public image datasets and several modestly sized personal photo collections. I also compared the performance of my method with that of two peer methods. The results are very positive, which indicate that my algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of my algorithm comes from its collaborative mining over online search results both in the visual and the textual domains. / published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
|
132 |
Advanced navigation algorithms for precision landingZanetti, Renato, 1978- 29 August 2008 (has links)
Not available
|
133 |
System-Level Algorithm Design for Radionavigation using UWB WaveformsIltis, Ronald A. 10 1900 (has links)
A radiolocation/navigation system is considered in which mobile nodes use ultra-wideband (UWB) radios to obtain inter-node ranges via round-trip travel time (RTT). Each node is also assumed to contain an inertial measurement unit (IMU) which generates 2D position estimates subject to Gaussian drift and additive noise errors. The key problem in such a system is obtaining 2 or 3-D position estimates from the nonlinear UWB range measurements and fusing the resulting UWB and IMU estimates. The system presented uses a Steepest Descent Random Start (SDRS) algorithm to solve the nonlinear positioning problem. It is shown that SDRS is a stable algorithim under a realistic communications reciprocity assumption. The SDRS estimates are then treated as measurements by the navigation Kalman filter. The navigation filter also processes separate IMU-derived position estimates to update node position/velocity. Simulation results for an urban corridor are given showing < 6 m. rms position errors.
|
134 |
Concept drift learning and its application to adaptive information filteringWidyantoro, Dwi Hendratmo 30 September 2004 (has links)
Tracking the evolution of user interests is a problem instance of concept drift learning. Keeping track of multiple interest categories is a natural phenomenon as well as an interesting tracking problem because interests can emerge and diminish at different time frames. The first part of this dissertation presents a Multiple Three-Descriptor Representation (MTDR) algorithm, a novel algorithm for learning concept drift especially built for tracking the dynamics of multiple target concepts in the information filtering domain. The learning process of the algorithm combines the long-term and short-term interest (concept) models in an attempt to benefit from the strength of both models. The MTDR algorithm improves over existing concept drift learning algorithms in the domain.
Being able to track multiple target concepts with a few examples poses an even more important and challenging problem because casual users tend to be reluctant to provide the examples needed, and learning from a few labeled data is generally difficult. The second part presents a computational Framework for Extending Incomplete Labeled Data Stream (FEILDS). The system modularly extends the capability of an existing concept drift learner in dealing with incomplete labeled data stream. It expands the learner's original input stream with relevant unlabeled data; the process generates a new stream with improved learnability. FEILDS employs a concept formation system for organizing its input stream into a concept (cluster) hierarchy. The system uses the concept and cluster hierarchy to identify the instance's concept and unlabeled data relevant to a concept. It also adopts the persistence assumption in temporal reasoning for inferring the relevance of concepts. Empirical evaluation indicates that FEILDS is able to improve the performance of existing learners particularly when learning from a stream with a few labeled data.
Lastly, a new concept formation algorithm, one of the key components in the FEILDS architecture, is presented. The main idea is to discover intrinsic hierarchical structures regardless of the class distribution and the shape of the input stream. Experimental evaluation shows that the algorithm is relatively robust to input ordering, consistently producing a hierarchy structure of high quality.
|
135 |
Grouping annotating and filtering history information in VKBAkkapeddi, Raghu C. 30 September 2004 (has links)
History mechanisms available in hypertext systems allow users access to past interactions with the system and help users incorporate those interactions into the current context. The history information can be useful to both the system and the user. The Visual Knowledge Builder (VKB) creates spatial hypertexts - visual workspaces for collecting, organizing, and sharing. It is based on prior work on VIKI. VKB records all edit events and presents them in the form of a "navigable history" as end-users work within an information workspace. My thesis explores attaching user interpretations of history via the grouping and annotation of edit events. Annotations can take the form of a plain text statement or one or more attribute/value pairs attached to individual events or group of events in the list. Moreover, I explore the value of history event filtering, limiting the edits and groups presented to those that match user descriptions. My contribution in this thesis is the addition of mechanisms whereby users can cope with larger history records in VKB via the process of grouping, annotating and filtering history information.
|
136 |
Identification of linear systems using periodic inputsCarew, Burian January 1974 (has links)
No description available.
|
137 |
A study of an on-line recursive filter applied to a milling circuit.Barker, Ian James. January 1975 (has links)
No abstract available. / Thesis (Ph.D.)-University of Natal, Durban,1975.
|
138 |
On-line estimation and control of molecular weight distributionAdebekun, Aderinola Kolawole 05 1900 (has links)
No description available.
|
139 |
Application of wavelets to adaptive optics and multiresolution wiener filteringBowman, Kevin W. 12 1900 (has links)
No description available.
|
140 |
Bayesian framework for multiple acoustic source trackingZhong, Xionghu January 2010 (has links)
Acoustic source (speaker) tracking in the room environment plays an important role in many speech and audio applications such as multimedia, hearing aids and hands-free speech communication and teleconferencing systems; the position information can be fed into a higher processing stage for high-quality speech acquisition, enhancement of a specific speech signal in the presence of other competing talkers, or keeping a camera focused on the speaker in a video-conferencing scenario. Most of existing systems focus on the single source tracking problem, which assumes one and only one source is active all the time, and the state to be estimated is simply the source position. However, in practical scenarios, multiple speakers may be simultaneously active, and the tracking algorithm should be able to localise each individual source and estimate the number of sources. This thesis contains three contributions towards solutions to multiple acoustic source tracking in a moderate noisy and reverberant environment. The first contribution of this thesis is proposing a time-delay of arrival (TDOA) estimation approach for multiple sources. Although the phase transform (PHAT) weighted generalised cross-correlation (GCC) method has been employed to extract the TDOAs of multiple sources, it is primarily used for a single source scenario and its performance for multiple TDOA estimation has not been comprehensively studied. The proposed approach combines the degenerate unmixing estimation technique (DUET) and GCC method. Since the speech mixtures are assumed window-disjoint orthogonal (WDO) in the time-frequency domain, the spectrograms can be separated by employing DUET, and the GCC method can then be applied to the spectrogram of each individual source. The probabilities of detection and false alarm are also proposed to evaluate the TDOA estimation performance under a series of experimental parameters. Next, considering multiple acoustic sources may appear nonconcurrently, an extended Kalman particle filtering (EKPF) is developed for a special multiple acoustic source tracking problem, namely “nonconcurrent multiple acoustic tracking (NMAT)”. The extended Kalman filter (EKF) is used to approximate the optimum weights, and the subsequent particle filtering (PF) naturally takes the previous position estimates as well as the current TDOA measurements into account. The proposed approach is thus able to lock on the sharp change of the source position quickly, and avoid the tracking-lag in the general sequential importance resampling (SIR) PF. Finally, these investigations are extended into an approach to track the multiple unknown and time-varying number of acoustic sources. The DUET-GCC method is used to obtain the TDOA measurements for multiple sources and a random finite set (RFS) based Rao-blackwellised PF is employed and modified to track the sources. Each particle has a RFS form encapsulating the states of all sources and is capable of addressing source dynamics: source survival, new source appearance and source deactivation. A data association variable is defined to depict the source dynamic and its relation to the measurements. The Rao-blackwellisation step is used to decompose the state: the source positions are marginalised by using an EKF, and only the data association variable needs to be handled by a PF. The performances of all the proposed approaches are extensively studied under different noisy and reverberant environments, and are favorably comparable with the existing tracking techniques.
|
Page generated in 0.0999 seconds