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

Ding-An Chiang

dblp:90/795 · DBLP profile ↗
← Back
20ranked-venue papers
11as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 14 · 9 first-authorDatabases, data management, data science and information retrieval · 6 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2Human-computer interaction and ubiquitous computing · 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.

Databases, data mining, and information retrieval
3 papers
Data mining · 60% Information retrieval · 30% Data models and query languages · 5%

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

TopicWeightPapersLastEvidence papers
Information retrieval › user behavior
consumer behavior prediction
0.112009
The Cyclic Model Analysis on Sequential Patterns · IEEE Trans. Knowl. Data Eng. 2009
Data mining
pattern mining
0.112009
The Cyclic Model Analysis on Sequential Patterns · IEEE Trans. Knowl. Data Eng. 2009
Data mining › pattern mining
sequential pattern mining
0.112009
The Cyclic Model Analysis on Sequential Patterns · IEEE Trans. Knowl. Data Eng. 2009
Query processing and optimization
query execution
0.021989
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information · PODS 1989
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values · SIGMOD Conference 1988
Data models and query languages › uncertain data
disjunctive information
0.011989
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information · PODS 1989
Data models and query languages › relational model
null values
0.011988
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values · SIGMOD Conference 1988
Data models and query languages
relational model
0.011988
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values · SIGMOD Conference 1988

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

statistical analysis · 0.1
YearPublicationVenuePosition
2011 Discovering cardholders' payment-patterns based on clustering analysis
Chien-Chou Shih, Ding-An Chiang, Yi-jen Hu, Chun-Chi Chen
Expert Syst. Appl.2
2010 Analysis on repeat-buying patterns
Ding-An Chiang, Yi-Hsin Wang, Shao-Ping Chen
Knowl. Based Syst.1
2010 Chinese text classification by the Naïve Bayes Classifier and the associative classifier with multiple confidence threshold values
Shing-Hwa Lu, Ding-An Chiang, Huan-Chao Keh, Hui-Hua Huang
Knowl. Based Syst.2
2009 Applying hybrid data mining techniques to web-based self-assessment system of Study and Learning Strategies Inventory
Chien-Chou Shih, Ding-An Chiang, Sheng-Wei Lai, Yen-Wei Hu
Expert Syst. Appl.2
2009 A recommender system to avoid customer churn: A case study
Ding-An Chiang, Mei-Hua Hsu, Cheng-Jung Lin, I-Long Lin
Expert Syst. Appl.2
2009 The Cyclic Model Analysis on Sequential Patterns
abstract
Sequential pattern mining has been used to predict various aspects of customer buying behavior for a long time. Discovered sequence reveals the chronological relation between items and provides valuable information to aid in developing marketing strategies. Nevertheless, we can hardly know whether the buying is cyclic and how long the interval between the two consecutive items in the sequential pattern is. To solve this problem, in this paper, data mining skills and the fundamentals of statistics are combined to develop a set of algorithms to unearth the cyclic properties of discovered sequential patterns. The algorithms, coupled with the sequential pattern mining process, constitute a thorough scheme to analyze and predict likely consumer behavior. The proposed algorithms are implemented and applied to test against real data collected from a consumer goods company. The experimental results illustrate how the model can be used to predict likely purchases within a certain time frame. Consequently, marketing professionals can execute campaigns to favorably impact customers' behaviors.
Ding-An Chiang, Cheng-Tzu Wang, Shao-Ping Chen, Chun-Chi Chen
IEEE Trans. Knowl. Data Eng.1
2008 The Chinese text categorization system with association rule and category priority
Ding-An Chiang, Huan-Chao Keh, Hui-Hua Huang, Derming Chyr
Expert Syst. Appl.1
2005 Mining interval sequential patterns
abstract
The main task of mining sequential patterns is to analyze the transaction database of a company in order to find out the priorities of items that most customers take when consuming. In this article, we propose a new method—the ISP Algorithm. With this method, we can find out not only the order of consumer items of each customer, but also offer the periodic interval of consumer items of each customer. Compared with other previous periodic association rules, the difference is that the period the algorithm provides is not the repeated purchases in a regular time, but the possible repurchases within a certain time frame. The algorithm utilizes the transaction time interval of individual customers and that of all the customers to find out when and who will buy goods, and what items of goods they will buy. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 359–373, 2005.
Ding-An Chiang, Shao-Lun Lee, Chun-Chi Chen, Ming-Hua Wang
Int. J. Intell. Syst.1
2003 Goal-oriented sequential pattern for network banking churn analysis
Ding-An Chiang, Shao-Lun Lee, Cheng-Jung Lin
Expert Syst. Appl.1
2003 Forecasting the leading index using fuzzy linguistic prediction
abstract
We propose a fuzzy linguistic prediction method for improving fuzzy random prediction. It uses the bit map summary to determine the trend of objects rising or falling and then uses the fuzzy linguistic summary to compute the parameter of fuzzy random prediction. To show how this method works, we use it to predict the present Taiwan leading index, which gives the economic trend for the next 3 months. By further predicting the leading indices of months that follow, we can forecast the economic trend for the next year. © 2003 Wiley Periodicals, Inc.
Ding-An Chiang, Yi-Hsin Wang, Yu-Liang Chuang
Int. J. Intell. Syst.1
2001 Measuring the quality of queries in the fuzzy relational databases
abstract
In this paper, we develop a new method to measure the quality of each tuple as an answer with respect to Select-Project-Join (SPJ) queries so that we can determine which answers are better answers to the given query in a fuzzy relational database. The quality of an answer is viewed as how much sure information is provided, and how much extra information is needed so that it will be a sure answer to the query. The less extra information that is required and the more sure information that is provided by an answer, the higher the quality of that answer is, and in consequence, it will be more reliable. © 2001 John Wiley & Sons, Inc.
Nan-Chen Hsien, Ding-An Chiang, Rick Chu-Tai Chiang
Int. J. Intell. Syst.2
2000 Multituning Fuzzy Control Systems Design
abstract
A multituning fuzzy control system structure that involves two simple, but effective tuning mechanisms, is proposed: one is called fuzzy control rule tuning mechanism (FCRTM); the other is called dynamic scalar tuning mechanism (DSTM). In FCRTM, it is used to generate the necessary control rules with a center extension method. In DSTM, it contains three fuzzy IF-THEN rules for determining the appropriate scaling factors for the fuzzy control system. In this paper, a method based on the genetic algorithm (GA) is proposed to simultaneously choose the appropriate parameters in FCRTM and DSTM. That is, the proposed GA-based method can automatically generate the required rule base of fuzzy controller and efficiently determine the appropriate map for building the dynamic scalars of fuzzy controller. A multiobjective fitness function is proposed to determine an appropriate parameter set such that not only the selected fuzzy control structure has fewer fuzzy rules, but also the controlled system has a good control performance. Finally, an inverted pendulum control problem is given to illustrate the effectiveness of the proposed control scheme.
Ching-Chang Wong, Ding-An Chiang, Hsuan-Ming Feng
Cybern. Syst.2
2000 Mining time series data by a fuzzy linguistic summary system
Ding-An Chiang, Louis R. Chow
Fuzzy Sets Syst.1
2000 Partial correlation of fuzzy sets
Ding-An Chiang, Nancy P. Lin
Fuzzy Sets Syst.1
1999 Correlation of fuzzy sets
Ding-An Chiang, Nancy P. Lin
Fuzzy Sets Syst.1
1998 Matching strengths of answers in fuzzy relational databases
abstract
Imprecise information is represented by fuzzy disjunctive information, and an extended fuzzy relational model is used to accommodate such information. In the presence of imprecise information, answers to a query can be categorized into two kinds of answers: sure answers and possible answers. To find more likely answers to a given query, the authors develop a method to measure the matching strength of each tuple as an answer to the query. The quality of an answer is higher in the case where less extra information is required and the more sure information is provided.
Ding-An Chiang, Nancy P. Lin, Chien-Chou Shih
IEEE Trans. Syst. Man Cybern. Part C1
1997 Fuzzy information in extended fuzzy relational databases
Ding-An Chiang, Louis R. Chow, Nan-Chen Hsien
Fuzzy Sets Syst.1
1996 A comparative analysis of different arbitration protocols for multiple-bus multiprocessors
Chi-Ming Chung, Ding-An Chiang, Qing Yang 0001
J. Comput. Sci. Technol.2
1989 A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information
abstract
Article Free Access Share on A sound and complete query evaluation algorithm for relational databases with disjunctive information Authors: L. Y. Yuan Database Research Laboratory, Department of Computing Science, University of Alberta, Edmonton, CANADA T6G 2H1 Database Research Laboratory, Department of Computing Science, University of Alberta, Edmonton, CANADA T6G 2H1View Profile , D.-A. Chiang The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA The Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LAView Profile Authors Info & Claims PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsMarch 1989 Pages 66–74https://doi.org/10.1145/73721.73727Online:29 March 1989Publication History 15citation160DownloadsMetricsTotal Citations15Total Downloads160Last 12 Months7Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Li-Yan Yuan, Ding-An Chiang
PODS2
1988 A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values
Li-Yan Yuan, Ding-An Chiang
SIGMOD Conference2