Browsing by Author Trương, Chí Tín


Or, select a letter below to browse by last name
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Issue DateTitleAuthor(s)Type
2013An efficient algorithm for mining frequent item-sets containing a constraint subsetDương, Văn Hải ; Trương, Chí TínJournal article
2013An efficient algorithm for mining frequent itemsets with single constraintDương, Văn Hải ; Trương, Chí Tín; Lê, Hoài BắcConference paper
2022Efficient Algorithms for Mining Closed and Maximal High Utility ItemsetsDương, Văn Hải; Hoàng, Minh Tiến; Trần, Thống; Trương, Chí Tín; Lê, Hoài Bắc; Fournier-Viger, PhilippeJournal article
2021Efficient algorithms for mining frequent high utility sequences with constraintsTrương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger; Unil Yun; Hamido FujitaJournal article
2011Efficient algorithms for mining frequent itemsets with constraintTrần, Ngọc Anh; Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài BắcConference paper
2018Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditionsDương, Văn Hải ; Trương, Chí Tín; Lê, Hoài BắcJournal article
2019Efficient high average-utility itemset mining using novel vertical weak upper-boundsTrương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger; Unil YunJournal article
2015An efficient method for mining association rules based on minimum single constraintsDương, Văn Hải ; Trương, Chí TínJournal article
2014An efficient method for mining frequent itemsets with double constraintsDương, Văn Hải ; Trương, Chí Tín; Võ, Đình BảyJournal article
2018An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processorsDương, Văn Hải ; Trương, Chí Tín; Lê, Hoài BắcConference paper
2019Efficient vertical mining of high average-utility itemsets based on novel upper-boundsTrương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-VigerJournal article
2020EHUSM: Mining High Utility Sequences with a Pessimistic Utility ModelPhilippe Fournier-Viger; Trương, Chí Tín; Trần, Ngọc Anh; Dương, Văn Hải ; Lê, Hoài BắcJournal article
2019An Explicit Relationship between Sequential Patterns and their Concise RepresentationsDương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc; Philippe Fournier-VigerConference paper
2017FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategyLê, Hoài Bắc; Dương, Văn Hải ; Trương, Chí Tín; Philippe Fournier-VigerJournal article
2019FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequencesTrương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-VigerJournal article
2021Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategiesTrương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger; Unil YunJournal article
2019HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholdsTrương, Chí Tín; Trần, Ngọc Anh; Dương, Văn Hải Journal article
2012Mining association rules restricted on constraintTrần, Ngọc Anh; Trương, Chí Tín; Lê, Hoài Bắc; Dương, Văn Hải Conference paper
2012Mining frequent itemsets with dualistic constraintsTrần, Ngọc Anh; Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài BắcConference paper
2021Mining High Utility Sequences with a Novel Utility FunctionHuỳnh, Hanh Thông; Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc; Philippe Fournier-VigerConference paper