scispace - formally typeset
Search or ask a question
Institution

University of Texas at Arlington

EducationArlington, Texas, United States
About: University of Texas at Arlington is a education organization based out in Arlington, Texas, United States. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 11758 authors who have published 28598 publications receiving 801626 citations. The organization is also known as: UT Arlington & University of Texas-Arlington.


Papers
More filters
Journal ArticleDOI
TL;DR: An integral reinforcement learning algorithm on an actor-critic structure is developed to learn online the solution to the Hamilton-Jacobi-Bellman equation for partially-unknown constrained-input systems and it is shown that using this technique, an easy-to-check condition on the richness of the recorded data is sufficient to guarantee convergence to a near-optimal control law.

410 citations

Journal ArticleDOI
TL;DR: In this paper, the mediating effects of salesperson information communication behaviors between social media use and customer satisfaction were investigated using salesperson-reported data, within a B2B context, empirically test a model using structural equation modeling.

409 citations

Proceedings Article
25 Jan 2015
TL;DR: A novel large-scale multi-view spectral clustering approach based on the bipartite graph that uses local manifold fusion to integrate heterogeneous features and can be easily extended to handle the out-of-sample problem.
Abstract: In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or views. Different views often provide different aspects of information that are complementary to each other. Several previous methods of clustering have demonstrated that better accuracy can be achieved using integrated information of all the views than just using each view individually. One important class of such methods is multi-view spectral clustering, which is based on graph Laplacian. However, existing methods are not applicable to large-scale problem for their high computational complexity. To this end, we propose a novel large-scale multi-view spectral clustering approach based on the bipartite graph. Our method uses local manifold fusion to integrate heterogeneous features. To improve efficiency, we approximate the similarity graphs using bipartite graphs. Furthermore, we show that our method can be easily extended to handle the out-of-sample problem. Extensive experimental results on five benchmark datasets demonstrate the effectiveness and efficiency of the proposed method, where our method runs up to nearly 3000 times faster than the state-of-the-art methods.

407 citations

Journal ArticleDOI
01 Feb 2011
TL;DR: It is shown that, similar to Q-learning, the new methods have the important advantage that knowledge of the system dynamics is not needed for the implementation of these learning algorithms or for the OPFB control.
Abstract: Approximate dynamic programming (ADP) is a class of reinforcement learning methods that have shown their importance in a variety of applications, including feedback control of dynamical systems. ADP generally requires full information about the system internal states, which is usually not available in practical situations. In this paper, we show how to implement ADP methods using only measured input/output data from the system. Linear dynamical systems with deterministic behavior are considered herein, which are systems of great interest in the control system community. In control system theory, these types of methods are referred to as output feedback (OPFB). The stochastic equivalent of the systems dealt with in this paper is a class of partially observable Markov decision processes. We develop both policy iteration and value iteration algorithms that converge to an optimal controller that requires only OPFB. It is shown that, similar to Q-learning, the new methods have the important advantage that knowledge of the system dynamics is not needed for the implementation of these learning algorithms or for the OPFB control. Only the order of the system, as well as an upper bound on its "observability index," must be known. The learned OPFB controller is in the form of a polynomial autoregressive moving-average controller that has equivalent performance with the optimal state variable feedback gain.

406 citations

Journal ArticleDOI
TL;DR: A new semi-supervised algorithm called ranking with Local Regression and Global Alignment (LRGA) to learn a robust Laplacian matrix for data ranking and a semi- supervised long-term RF algorithm to refine the multimedia data representation.
Abstract: We present a new framework for multimedia content analysis and retrieval which consists of two independent algorithms. First, we propose a new semi-supervised algorithm called ranking with Local Regression and Global Alignment (LRGA) to learn a robust Laplacian matrix for data ranking. In LRGA, for each data point, a local linear regression model is used to predict the ranking scores of its neighboring points. A unified objective function is then proposed to globally align the local models from all the data points so that an optimal ranking score can be assigned to each data point. Second, we propose a semi-supervised long-term Relevance Feedback (RF) algorithm to refine the multimedia data representation. The proposed long-term RF algorithm utilizes both the multimedia data distribution in multimedia feature space and the history RF information provided by users. A trace ratio optimization problem is then formulated and solved by an efficient algorithm. The algorithms have been applied to several content-based multimedia retrieval applications, including cross-media retrieval, image retrieval, and 3D motion/pose data retrieval. Comprehensive experiments on four data sets have demonstrated its advantages in precision, robustness, scalability, and computational efficiency.

405 citations


Authors

Showing all 11918 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Hyun-Chul Kim1764076183227
David H. Adams1551613117783
Andrew White1491494113874
Kaushik De1391625102058
Steven F. Maier13458860382
Andrew Brandt132124694676
Amir Farbin131112583388
Evangelos Gazis131114784159
Lee Sawyer130134088419
Fernando Barreiro130108283413
Stavros Maltezos12994379654
Elizabeth Gallas129115785027
Francois Vazeille12995279800
Sotirios Vlachos12878977317
Network Information
Related Institutions (5)
Georgia Institute of Technology
119K papers, 4.6M citations

95% related

University of Maryland, College Park
155.9K papers, 7.2M citations

95% related

Pennsylvania State University
196.8K papers, 8.3M citations

95% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

94% related

University of Texas at Austin
206.2K papers, 9M citations

94% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202353
2022243
20211,721
20201,664
20191,493
20181,462