
![]()
![]()
Important Notice:
This material is presented to ensure timely
dissemination of scholarly and technical
work. Copyright and all rights therein are
retained by authors or by other copyright
holders. All persons copying this information
are expected to adhere to the terms and constraints
invoked by each author's copyright. In most
cases, these works may not be reposted without
the explicit permission of the copyright
holder.
| 2002 | 2001 | 2000 | 1999 | Prior to 1999 |
|---|
2002
D. E. Johnson, F. J. Oles, T. Zhang and T.
Goetz. A Decision-Tree-Based Symbolic Rule Induction
System for Text Categorization. Submitted to the IBM Systems Journal, special
issue on AI, scheduled for Aug., 2002.
Tong Zhang. On the dual formulation of regularized linear
systems with convex risks. To appear in Machine Learning Journal,
vol 46, 2002, pp. 91-129.
Tong Zhang. Covering number bounds of certain
regularized linear function classes. To appear
in J. Machine Learning Research, 0:0-0, 2002.
Tong Zhang. On the dual formulation of regularized
linear systems. To appear in Machine Learning,
46:91-129, 2002.
Tong Zhang and Gene H. Golub. Rank-one approximation
to high order tensors. SIMAX, 0:0-0, 2002.
Tong Zhang and Carlo Tomasi. On the consistency
of instantaneous rigid motion estimation.
To appear in International Journal of Computer
Vision, 46:0-0, 2002.
2001
Thilo Goetz, Robin Lougee-Heimer and Nicolas
Nicolov. Efficient Indexing for Typed Feature Structures. Proceedings of Recent Advances in Natural
Language Processing, Tzigov Chark, Bulgaria,
2001.
Thilo Goetz and Holger Wunsch. An Abstract Machine Approach to Finite State
Transduction Over Large Character Sets. Workshop on Finite State Methods in Natural
Language Processing, Helsinki, Finland, 2001.
V.S. Iyengar and T.Zhang. Empirical study
of recommender systems using linear classifiers.
PAKDD 01, pages 709-717, 2001.
S. Lappin, R. Levine and D. Johnson. The
Revolution Maximally Confused. Natural Language
and Linguistic Theory,19:4, 2001.
Tong Zhang. Regularized Winnow methods. Advances
in Neural Information Processing Systems
13, pages 703-709, 2001.
Tong Zhang. A leave-one-out cross validation
bound for kernel methods with applications
in learning. COLT, pages 427-443, 2001.
Tong Zhang. A sequential approximation bound
for some sample-dependent convex optimization
problems with applications in learning. COLT,
pages 65-81, 2001.
Tong Zhang. Some sparse approximation bounds
for regression problems. ICML, pages 624-631,
2001.
Tong Zhang. A general greedy approximation
algorithm with applications. To appear in
NIPS 01, pages 0-0, 2001.
Tong Zhang. Generalization performance of
some learning problems in Hilbert functional
spaces. To appear in NIPS 01, pages 0-0,
2001.
Tong Zhang. A Leave-one-out Cross Validation Bound for
Kernel Methods with Applications in Learning. COLT 2001, pp. 427-443.
Tong Zhang, Fred Damerau and David E. Johnson.
Text Chunking using Regularized Winnow. ACL 2001, pp. 539-546.
Tong Zhang and Frank J. Oles.Text Categorization based on regularized
linear classification methods. Information Retrieval, vol 4, 2001, pp.
5-31.
2000
J. Cullum, A. Ruehli, and T. Zhang. A method
for reduced-order modeling and simulation
of large interconnect circuits and its application
to peec models including retardation. IEEE
Trans. Circ. Sys., 47:261- 273, 2000.
F. Damerau, S.M. Weiss, C. Apte andB.F. White.
Lightweight Document Matching for Help-Desk
Applications.
IEEE Intelligent Systems Journal, v15, no
2., 2000, pp. 57-61.
V.S. Iyengar, C.Apte, and T.Zhang. Active
learning using adaptive resampling. KDD 00,
pages 91-98, 2000.
S. Lappin, R. Levine and D. Johnson. The
Revolution Confused: A Reply to our Critics.
Natural Language and Linguistic Theory, 14,
2000.
S. Lappin, R. Levine and D. Johnson. The
Structure of Unscientific Revolutions. Natural
Language and Linguistic Theory, 14, 2000.
F. J. Oles. An application of lattice theory to knowledge
representation. Theoretical Computer Science 249 (2000),
pp. 163-196.
S. Weiss, B. White, C. Apte and F. Damerau.
Lightweight Document Matching for Help-Desk
Applications. IEEE Intelligent Systems (March/April),
2000.
Tong Zhang. Large margin Winnow methods for
text categorization. KDD 2000 Workshop on
Text Mining, pages 81-87, 2000.
Tong Zhang and Frank J. Oles. A probability analysis on the value of unlabeled
data for classification problems. ICML 2000, pp. 1191-1198.
1999
Thilo Goetz. Feature Constraint Grammars. PhD thesis, University of Tübingen,
Germany, 1999.
D. Johnson and S. Lappin. Local Constraints
vs. Economy. CSLI, Stanford UP, Stanford,
CA, 1999.
S. M. Weiss, C. Apte, F. J. Damerau, D. E.
Johnson, F. J. Oles, T. Goetz and T. Hampp.
Maximizing Text-Mining Performance. IEEE Intelligent Systems, July-August 1999.
Prior to 1999
C. Apte, F. Damerau, S. Weiss. Towards Language
Independent Automated Learning Of Text Categorization
models. Proceedings of the 17 th Annual ACM/SIGIR
Conference, 1994.
Fred Damerau, Chidanand Apte and Sholom Weiss.
Automated Learning of Decision Rules for
Text Categorization, ACM Transactions on
Information Systems, Volume 12, Number 3,(1994)
pp. 233-251
Fred Damerau. Generating and Evaluating Domain-Oriented
Multi-Word Terms from Texts, Information
Processing and Management, Volume 29, No.
4, (1993) pp. 433-447.
Fred Damerau. Automatic Compilation of Biographical
Dictionaries. Information Storage and Retrieval
Vol. 8, No. 6, 1972, pp. 315-327.
Fred Damerau. A Technique for Computer Correction
of Spelling Errors, Communications of the
ACM,
(March 1964) pp. 171-176.
D. Johnson and L. Moss (eds.) . Linguistics
and Philosophy: Special Issue on the Mathematics
of Language, 1998.
D. Johnson and S. Lappin. A Critique of the
Minimalist Program. Linguistics and Philosophy,
20, 1997.
Last Update : December 12, 2001
>