#### Filter Results:

- Full text PDF available (27)

#### Publication Year

2000

2012

- This year (0)
- Last 5 years (4)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Jie Chen, Haw-ren Fang, Yousef Saad
- Journal of Machine Learning Research
- 2009

Nearest neighbor graphs are widely used in data mining and machine learning. A brute-force method to compute the exact kNN graph takes Θ(dn2) time for n data points in the d dimensional Euclidean space. We propose two divide and conquer methods for computing an approximate kNN graph in Θ(dnt) time for high dimensional data (large d). The exponent t ∈ (1,2)… (More)

- Haw-ren Fang, Yousef Saad
- Numerical Lin. Alg. with Applic.
- 2009

Many applications in science and engineering lead to models which require solving large-scale fixed point problems, or equivalently, systems of nonlinear equations. Several successful techniques for handling such problems are based on quasi-Newton methods that implicitly update the approximate Jacobian or inverse Jacobian to satisfy a certain secant… (More)

- Haw-ren Fang, Yousef Saad
- SIAM J. Scientific Computing
- 2012

When combined with Krylov projection methods, polynomial filtering can provide a powerful method for extracting extreme or interior eigenvalues of large sparse matrices. This general approach can be quite efficient in the situation when a large number of eigenvalues is sought. However, its competitiveness depends critically on a good implementation. This… (More)

- James Glenn, Haw-ren Fang, Clyde P. Kruskal
- Computers and Games
- 2006

A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. In this article we prove the existence and uniqueness of the solution to one-player Can’t Stop, and give an… (More)

The identification of genes in biomedical text typically consists of two stages: identifying gene mentions and normalization of gene names. We have created an automated process that takes the output of named entity recognition (NER) systems designed to identify genes and normalizes them to standard referents. The system identifies human gene synonyms from… (More)

- Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
- 2008 Seventh International Conference on Machine…
- 2008

Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. This paper presents a multilevel framework to reduce the size of the data set, prior to performing dimension reduction. The algorithm exploits nearest-neighbor graphs. It recursively… (More)

- Haw-ren Fang, Sophia Sakellaridi, Yousef Saad
- CIKM
- 2010

In the past decade, a number of nonlinear dimensionality reduction methods using an affinity graph have been developed for manifold learning. This paper explores a multilevel framework with the goal of reducing the cost of unsupervised manifold learning and preserving the embedding quality at the same time. An application to spectral clustering is also… (More)

A two-player, finite, probabilistic game with perfect information can be presented as a four-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. In a previous paper we have presented our success on tackling one-player Can’t Stop. In this paper we prove the existence… (More)

- Haw-ren Fang, Sven Leyffer, Todd S. Munson
- Optimization Methods and Software
- 2012

We present a pivoting algorithm for solving linear programs with linear complementarity constraints. Our method generalizes the simplex method for linear programming to deal with complementarity conditions. We develop an anticycling scheme that can verify Bouligand stationarity. We also give an optimizationbased technique to find an initial feasible vertex.… (More)

- Haw-ren Fang, Dianne P. O'Leary
- SIAM J. Matrix Analysis Applications
- 2006

We call a matrix triadic if it has no more than two nonzero off-diagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider LXLT factorizations of symmetric triadic matrices, where L is unit lower triangular and X is diagonal, block diagonal with 1×1 and 2×2 blocks, or the identity with L lower triangular. We… (More)