Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philip W. Tse

dblp:20/4720 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational finance and economics
financial market analysis
0.012002
Mining Associated Implication Networks: Computational Intermarket Analysis · ICDM 2002
Data mining › pattern mining
association rule mining
0.012002
Mining Associated Implication Networks: Computational Intermarket Analysis · ICDM 2002

Methods — techniques the papers use, named apart from their topics

implication networks · 0.1association rule mining · 0.1
YearPublicationVenuePosition
2002 Mining Associated Implication Networks: Computational Intermarket Analysis
abstract
Current attempts to analyze international financial markets include the use of financial technical analysis and data mining techniques. In this paper, we propose a new approach that incorporates implication networks and association rules to form an associated network structure. The proposed approach explicitly addresses the issue of local vs. global influences between financial markets.
Philip W. Tse, Jiming Liu 0001
ICDM1
1997 Performance and Fairness Comparison between EFCI and ERF Flow Control Schemes for the ABR Service in ATM Networks
abstract
In this paper we compare, by simulation based on real traffic traces, the EFCI (explicit forward congestion indication) and the ERF (explicit rate feedback) rate-based flow control algorithms for the available bit rate (ABR) service in ATM networks. The factors under consideration are: (1) distance from source to destination and (2) rate of resource management (RM) cells. Although no significant fairness throughput problem has been identified in both EFCI and ERF, sources with high end-to-end propagation delay will experience higher queueing delay and loss probability. In this paper, we have also shown that although EFCI can lead to considerably lower utilisation than ERF if the parameters are set arbitrarily, it can perform as good as or close to ERF if there were complementary software which can compute the optimal parameters for EFCI based on the on-line measurement of traffic streams.
Moshe Zukerman, Philip W. Tse
ICC (1)2
1997 An Adaptive Connection Admission Control Scheme for ATM Networks
abstract
A new adaptive connection admission control scheme is proposed. The aggregate statistics of all calls in progress are continuously measured and new calls are considered as CBR at their peak during certain warming up period. The main features of our proposed CAC scheme are (1) an adaptive mechanism which updates the warming up period based on the traffic conditions, (2) an accurate mechanism to predict cell loss, and (3) a simple and conservative way to consider call departures. We demonstrate by simulation that the scheme is more efficient than several other schemes.
Moshe Zukerman, Philip W. Tse
ICC (3)2