NUMERIC MULTI-OBJECTIVE RULE MINING USING SIMULATED ANNEALING ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NASIRI M.; SADAT TAGHAVI L.; MINAEE B.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH Year:2011 | Volume:1 | Issue:2 Page(s): 37-48

Download Full-Text

View:

374

Download:

211

Cites:

Information Journal Paper

Title

NUMERIC MULTI-OBJECTIVE RULE MINING USING SIMULATED ANNEALING ALGORITHM

Author(s)

NASIRI M. | SADAT TAGHAVI L. | MINAEE B. | Issue Writer Certificate

Keywords

SIMULATED ANNEALING

NUMERIC ASSOCIATION RULE MINING

Abstract

Association rule mining process can be visualized as a multi-objective problem rather than as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the database. Confidence represents the proportion of records for which the prediction of the rule (or model in the case of a complete classification) is correct, and it is one of the most widely quoted measures of quality, especially in the context of complete classification. Interestingness measures how much interesting the rule is. Using these three measures as the objectives of rule mining problem, this article uses a SIMULATED ANNEALING algorithm to extract some useful and interesting rules from any Market-basket type databases. The experimental results show that the algorithm may be suitable for large and noisy datasets but don't stay in local minimum.

Cites

EVALUATION OF CORRELATION BETWEEN RISK FACTORS OF BREAST TUMORS BY MULTI NOMINAL LOGIT MODEL

References

No record.

Cite

APA: Copy

NASIRI, M., SADAT TAGHAVI, L., & MINAEE, B.. (2011). NUMERIC MULTI-OBJECTIVE RULE MINING USING SIMULATED ANNEALING ALGORITHM. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, 1(2), 37-48. SID. https://sid.ir/paper/592921/en

Vancouver: Copy

NASIRI M., SADAT TAGHAVI L., MINAEE B.. NUMERIC MULTI-OBJECTIVE RULE MINING USING SIMULATED ANNEALING ALGORITHM. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH[Internet]. 2011;1(2):37-48. Available from: https://sid.ir/paper/592921/en

IEEE: Copy

M. NASIRI, L. SADAT TAGHAVI, and B. MINAEE, “NUMERIC MULTI-OBJECTIVE RULE MINING USING SIMULATED ANNEALING ALGORITHM,” INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, vol. 1, no. 2, pp. 37–48, 2011, [Online]. Available: https://sid.ir/paper/592921/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops