Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2024
Question Difficulty Consistent Knowledge Tracing
WWW '24: Proceedings of the ACM Web Conference 2024Pages 4239–4248https://doi.org/10.1145/3589334.3645582Knowledge tracing aims to estimate knowledge states of students over a set of skills based on students' past learning activities. Deep learning based knowledge tracing models show superior performance to traditional knowledge tracing approaches. Early ...
- ArticleJuly 2018
Dynamic Bayesian logistic matrix factorization for recommendation with implicit feedback
IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial IntelligencePages 3463–3469Matrix factorization has been widely adopted for recommendation by learning latent embeddings of users and items from observed user-item interaction data. However, previous methods usually assume the learned embeddings are static or homogeneously ...
- research-articleAugust 2016
Repeat Buyer Prediction for E-Commerce
KDD '16: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data MiningPages 155–164https://doi.org/10.1145/2939672.2939674A large number of new buyers are often acquired by merchants during promotions. However, many of the attracted buyers are one-time deal hunters, and the promotions may have little long-lasting impact on sales. It is important for merchants to identify ...
- research-articleJune 2015
Supporting Exploratory Hypothesis Testing and Analysis
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 9, Issue 4Article No.: 31, Pages 1–24https://doi.org/10.1145/2701430Conventional hypothesis testing is carried out in a hypothesis-driven manner. A scientist must first formulate a hypothesis based on what he or she sees and then devise a variety of experiments to test it. Given the rapid growth of data, it has become ...
- articleMay 2013
A performance study of three disk-based structures for indexing and querying frequent itemsets
Proceedings of the VLDB Endowment (PVLDB), Volume 6, Issue 7Pages 505–516https://doi.org/10.14778/2536349.2536351Frequent itemset mining is an important problem in the data mining area. Extensive efforts have been devoted to developing efficient algorithms for mining frequent itemsets. However, not much attention is paid on managing the large collection of ...
-
- demonstrationAugust 2012
AssocExplorer: an association rule visualization system for exploratory data analysis
KDD '12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningPages 1536–1539https://doi.org/10.1145/2339530.2339774We present a system called AssocExplorer to support exploratory data analysis via association rule visualization and exploration. AssocExplorer is designed by following the visual information-seeking mantra: overview first, zoom and filter, then details ...
- research-articleAugust 2012
Finding minimum representative pattern sets
KDD '12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningPages 51–59https://doi.org/10.1145/2339530.2339543Frequent pattern mining often produces an enormous number of frequent patterns, which imposes a great challenge on understanding and further analysis of the generated patterns. This calls for finding a small number of representative patterns to best ...
- research-articleJanuary 2012
- research-articleNovember 2011
An empirical comparison of several recent epistatic interaction detection methods
Bioinformatics (BIOI), Volume 27, Issue 21Pages 2936–2943https://doi.org/10.1093/bioinformatics/btr512Motivation: Many new methods have recently been proposed for detecting epistatic interactions in GWAS data. There is, however, no in-depth independent comparison of these methods yet.
Results: Five recent methods—TEAM, BOOST, SNPHarvester, ...
- research-articleOctober 2011
Controlling false positives in association rule mining
Proceedings of the VLDB Endowment (PVLDB), Volume 5, Issue 2Pages 145–156https://doi.org/10.14778/2078324.2078330Association rule mining is an important problem in the data mining area. It enumerates and tests a large number of rules on a dataset and outputs rules that satisfy user-specified constraints. Due to the large number of rules being tested, rules that do ...
- ArticleAugust 2011
Progressive Graphical Simplification of Contour Lines Based on Topographical Feature Constraints
ISIE '11: Proceedings of the 2011 International Conference on Intelligence Science and Information EngineeringPages 181–184https://doi.org/10.1109/ISIE.2011.65In order to reduce the points on contour lines, an optimized model based on progressive simplifying method for contour lines satisfied by the terrain feature constraints is proposed. Firstly the topographical characteristic points and feature lines are ...
- ArticleApril 2011
Towards exploratory hypothesis testing and analysis
ICDE '11: Proceedings of the 2011 IEEE 27th International Conference on Data EngineeringPages 745–756https://doi.org/10.1109/ICDE.2011.5767907Hypothesis testing is a well-established tool for scientific discovery. Conventional hypothesis testing is carried out in a hypothesis-driven manner. A scientist must first formulate a hypothesis based on his/her knowledge and experience, and then ...
- articleJanuary 2011
A case study on financial ratios via cross-graph quasi-bicliques
Information Sciences: an International Journal (ISCI), Volume 181, Issue 1Pages 201–216https://doi.org/10.1016/j.ins.2010.08.035Stocks with similar financial ratio values across years have similar price movements. We investigate this hypothesis by clustering groups of stocks that exhibit homogeneous financial ratio values across years, and then study their price movements. We ...
- ArticleOctober 2010
Design and Application of Intelligent Reasoning Module Based on Rough Set
IPTC '10: Proceedings of the 2010 International Symposium on Intelligence Information Processing and Trusted ComputingPages 663–666https://doi.org/10.1109/IPTC.2010.31To enhance the ability of intelligent reasoning and decision-making modules of present MIS, an algorithm is proposed which using rough set to reduce sampling data and produce rule library. It is done by giving a knowledge reduction and rule extraction ...
- ArticleJune 2010
Efficiently finding the best parameter for the emerging pattern-based classifier PCL
PAKDD'10: Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part IPages 121–133https://doi.org/10.1007/978-3-642-13657-3_15Emerging patterns are itemsets whose frequencies change sharply from one class to the other. PCL is an example of efficient classification algorithms that leverage the prediction power of emerging patterns. It first selects the top-K emerging patterns ...
- articleDecember 2009
Efficient mining of distance-based subspace clusters
Traditional similarity measurements often become meaningless when dimensions of datasets increase. Subspace clustering has been proposed to find clusters embedded in subspaces of high-dimensional datasets. Many existing algorithms use a grid-based ...