Search results for "itemsets"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
109	Peien Feng, Hui Zhang, Qingying Qiu, Zhaoxia Wang	PCAR: An Efficient Approach for Mining Association Rules.	FSKD (2)	2008	DBLP DOI BibTeX RDF
105	Jia-Ling Koh, Ching-Yi Lin	Concept Shift Detection for Frequent Itemsets from Sliding Windows over Data Streams.	DASFAA Workshops	2009	DBLP DOI BibTeX RDF	Data Streams, Change Detection, Frequent Itemsets
105	Jouni K. Seppänen, Heikki Mannila	Dense itemsets.	KDD	2004	DBLP DOI BibTeX RDF	frequent itemsets, error tolerance
101	Tsuyoshi Taniguchi, Makoto Haraguchi	An Algorithm for Mining Implicit Itemset Pairs Based on Differences of Correlations.	Discovery Science	2005	DBLP DOI BibTeX RDF
98	Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz	Catch the moment: maintaining closed frequent itemsets over a data stream sliding window.	Knowl. Inf. Syst.	2006	DBLP DOI BibTeX RDF	Data streams, Incremental learning, Sliding window, Closed frequent itemset
98	Juho Muhonen, Hannu Toivonen	Closed Non-derivable Itemsets.	PKDD	2006	DBLP DOI BibTeX RDF
98	Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz	Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window.	ICDM	2004	DBLP DOI BibTeX RDF
96	R. V. Nataraj, S. Selvan	A framework for mining top-k frequent closed itemsets using order preserving generators.	Bangalore Compute Conf.	2009	DBLP DOI BibTeX RDF	mining methods, data mining, algorithms, closed itemsets
96	Daniel Kunkle, Donghui Zhang, Gene Cooperman	Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	frequent generalized itemsets, redundancy avoidance, generalized association rules
96	Soon M. Chung, Congnan Luo	Efficient mining of maximal frequent itemsets from databases on a cluster of workstations.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Scalability, Association rules, Parallel data mining, Maximal frequent itemsets
96	Tae-Su Park, Ju-Hong Lee, Sang Ho Park, Bumghi Choi, Deok-Hwan Kim	Search Method of Time Sensitive Frequent Itemsets in Data Streams.	CIARP	2006	DBLP DOI BibTeX RDF	Data Mining, Data Stream, Frequent Itemsets
95	Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin Lin	An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream.	IEA/AIE	2009	DBLP DOI BibTeX RDF	Data Mining, Data Stream, Frequent Itemsets, Frequent Closed Itemsets
91	Don-Lin Yang, Ching-Ting Pan, Yeh-Ching Chung	An Efficient Hash-Based Method for Discovering the Maximal Frequent Set.	COMPSAC	2001	DBLP DOI BibTeX RDF	the HMFS method, data mining, association rules, frequent itemsets
89	Irene Ntoutsi, Yannis Theodoridis	Comparing Datasets Using Frequent Itemsets: Dependency on the Mining Parameters.	SETN	2008	DBLP DOI BibTeX RDF
89	Guojie Song, Dongqing Yang, Bin Cui 0001, Baihua Zheng, Yunfeng Liu, Kunqing Xie	CLAIM: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data.	DASFAA	2007	DBLP DOI BibTeX RDF
88	Jiayin Feng, Jiadong Ren	MMFI_DSSW - A New Method to Incrementally Mine Maximal Frequent Itemsets in Transaction Sensitive Sliding Window.	KSEM	2007	DBLP DOI BibTeX RDF	algorithm, data streams, maximal frequent itemsets
86	Bai-En Shie, Vincent S. Tseng, Philip S. Yu	Online mining of temporal maximal utility itemsets from data streams.	SAC	2010	DBLP DOI BibTeX RDF	maximal itemsets, temporal high utility itemsets, data stream mining, utility mining
84	Vincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu	UP-Growth: an efficient algorithm for high utility itemset mining.	KDD	2010	DBLP DOI BibTeX RDF	candidate pruning, high utility itemset, frequent itemset, utility mining
83	Salvatore Ruggieri	Frequent regular itemset mining.	KDD	2010	DBLP DOI BibTeX RDF	closed and free itemsets, concise representations
81	Zequn Zhou, Christie I. Ezeife	A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property.	AI	2001	DBLP DOI BibTeX RDF	Maintaining Mining Asociation Rules, High Level Large Itemsets, Low Level Large Itemsets, Apriori Property
81	Mirko Böttcher, Martin Spott, Rudolf Kruse	A Condensed Representation of Itemsets for Analyzing Their Evolution over Time.	ECML/PKDD (1)	2009	DBLP DOI BibTeX RDF
81	Xiangjun Dong, Zhendong Niu, Donghua Zhu 0001, Zhiyun Zheng, Qiuting Jia	Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model.	ADMA	2008	DBLP DOI BibTeX RDF
81	Jie Dong, Min Han	IFCIA: An Efficient Algorithm for Mining Intertransaction Frequent Closed Itemsets.	FSKD (2)	2007	DBLP DOI BibTeX RDF
81	Xu-dong Song, Kun Zhai, Xiao-bing Liu	The Efficient and Complete Frequent Itemsets Mining of Association Rules.	FSKD (1)	2007	DBLP DOI BibTeX RDF
81	Hassan H. Malik, John R. Kender	High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets.	ICDM	2006	DBLP DOI BibTeX RDF
79	Bo He, Yue Wang, Wu Yang, Yuan Chen	Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database.	RSKT	2006	DBLP DOI BibTeX RDF	Global frequent itemsets, distributed database, FP-tree, FP-growth
79	Kai Chen	Mining Frequent Closed Itemsets Without Candidate Generation.	ISPA	2005	DBLP DOI BibTeX RDF	data mining, association rule, stack, frequent closed itemsets
75	Li Yang 0008	Pruning and Visualizing Generalized Association Rules in Parallel Coordinates.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	data mining, Association rules, data visualization, mining methods and algorithms, interactive data exploration
75	Dao-I Lin, Zvi M. Kedem	Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	maximum frequent set, Pincer Search, maximum frequent candidate set, Data mining, association rule, knowledge discovery
75	Dao-I Lin, Zvi M. Kedem	Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set.	EDBT	1998	DBLP DOI BibTeX RDF
74	Toon Calders, Bart Goethals	Non-derivable itemset mining.	Data Min. Knowl. Discov.	2007	DBLP DOI BibTeX RDF	Data mining, Itemsets, Condensed representation
72	Nikolaj Tatti, Jilles Vreeken	Finding Good Itemsets by Packing Data.	ICDM	2008	DBLP DOI BibTeX RDF
72	Kun Li, Yongyan Wang, M. Ellahi, Hongan Wang	Mining Recent Frequent Itemsets in Data Streams.	FSKD (4)	2008	DBLP DOI BibTeX RDF
72	Wassim Ayadi, Khedija Arour	A Binary Decision Diagram to discover low threshold support frequent itemsets.	DEXA Workshops	2007	DBLP DOI BibTeX RDF	data mining, association rules, binary decision diagram, frequent item sets
72	Jianyong Wang 0001, Jiawei Han 0001, Ying Lu 0001, Petre Tzvetkov	TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF
72	Ningthoujam Gourakishwar Singh, Sanasam Ranbir Singh, Anjana Kakoti Mahanta	CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets.	ICDM	2005	DBLP DOI BibTeX RDF
72	Taneli Mielikäinen	Transaction Databases, Frequent Itemsets, and Their Condensed Representations.	KDID	2005	DBLP DOI BibTeX RDF
72	Toon Calders, Bart Goethals	Mining All Non-derivable Frequent Itemsets.	PKDD	2002	DBLP DOI BibTeX RDF
71	Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee	DSM-FI: an efficient algorithm for mining frequent itemsets in data streams.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Single-pass algorithm, Landmark window, Data mining, Data streams, Frequent itemsets
71	Wassim Ayadi, Khedija Arour	A Novel Parallel Boolean Approach for Discovering Frequent Itemsets.	ICDM Workshops	2007	DBLP DOI BibTeX RDF	Data mining, Association rules, Binary decision diagram, Frequent itemsets, Parallel data mining
71	Nan Jiang, Le Gruenwald	CFI-Stream: mining closed frequent itemsets in data streams.	KDD	2006	DBLP DOI BibTeX RDF	association rules, data stream, frequent closed itemsets
71	Xuegang Hu, Haitao Yu	The Research of Sampling for Mining Frequent Itemsets.	RSKT	2006	DBLP DOI BibTeX RDF	weighted sampling, statistical optimal sample size, Data Mining, association rule, frequent itemsets
71	Roman Tesar, Vaclav Strnad, Karel Jezek, Massimo Poesio	Extending the single words-based document model: a comparison of bigrams and 2-itemsets.	ACM Symposium on Document Engineering	2006	DBLP DOI BibTeX RDF	bigrams, machine learning, feature selection, text categorization, comparison, n-grams, document model, itemsets
71	Joong Hyuk Chang, Won Suk Lee	Effect of Count Estimation in Finding Frequent Itemsets over Online Transactional Data Streams.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	count estimation, transactional data streams, frequent itemsets
71	Yin-Ling Cheung, Ada Wai-Chee Fu	Mining Frequent Itemsets without Support Threshold: With and without Item Constraints.	IEEE Trans. Knowl. Data Eng.	2004	DBLP DOI BibTeX RDF	N-most interesting itemsets, item constraints, Association rules, FP-tree
71	Soon Myoung Chung, Congnan Luo	Parallel Mining of Maximal Frequent Itemsets from Databases.	ICTAI	2003	DBLP DOI BibTeX RDF	scalability, association rules, Parallel data mining, maximal frequent itemsets
70	Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001	Fast and Memory Efficient Mining of Frequent Closed Itemsets.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	high-performance algorithms, Data mining, association rules, frequent itemsets, condensed representations, closed itemsets
67	R. Uday Kiran, P. Krishna Reddy	An improved multiple minimum support based approach to mine rare association rules.	CIDM	2009	DBLP DOI BibTeX RDF
67	Hsuan-Shih Lee	On-Line Association Rules Mining with Dynamic Support.	KES (2)	2006	DBLP DOI BibTeX RDF
67	Shichao Zhang 0001, Jeffrey Xu Yu, Jingli Lu, Chengqi Zhang	Is Frequency Enough for Decision Makers to Make Decisions?.	PAKDD	2006	DBLP DOI BibTeX RDF
64	Marzena Kryszkiewicz, Henryk Rybinski, Marcin Gajek	Dataless Transitions Between Concise Representations of Frequent Patterns.	J. Intell. Inf. Syst.	2004	DBLP DOI BibTeX RDF	data mining, knowledge discovery, frequent itemsets, closed itemsets, concise representation
64	Nikolaj Tatti	Probably the best itemsets.	KDD	2010	DBLP DOI BibTeX RDF	bayesian model selection, decomposable models, exponential models, MCMC, junction tree, itemset mining
64	En Tzu Wang, Arbee L. P. Chen	A novel hash-based approach for mining frequent itemsets over data streams requiring less memory space.	Data Min. Knowl. Discov.	2009	DBLP DOI BibTeX RDF	Hash-based approach, Data mining, Data stream, Frequent itemset, False positive
64	Jin Qian, Feiyue Ye	Mining Maximal Frequent Itemsets with Frequent Pattern List.	FSKD (1)	2007	DBLP DOI BibTeX RDF
64	Xuegang Hu, Wei Liu, Dexing Wang, Xindong Wu 0001	Mining Frequent Itemsets Using a Pruned Concept Lattice.	FSKD (3)	2007	DBLP DOI BibTeX RDF
64	Junbo Chen, Shanping Li	GC-Tree: A Fast Online Algorithm for Mining Frequent Closed Itemsets.	PAKDD Workshops	2007	DBLP DOI BibTeX RDF
64	Tianming Hu, Qian Fu, Xiaonan Wang 0002, Sam Yuan Sung	Mining Maximum Length Frequent Itemsets: A Summary of Results.	ICTAI	2006	DBLP DOI BibTeX RDF
64	Lei Jia, Jun Yao, Renqing Pei	Mining Association Rules with Frequent Closed Itemsets Lattice.	KES	2003	DBLP DOI BibTeX RDF
64	Lei Jia, Jun Yao, Renqing Pei	Using Loose and Tight Bounds to Mine Frequent Itemsets.	KES	2003	DBLP DOI BibTeX RDF
64	Kritsada Sriphaew, Thanaruk Theeramunkong	A new method for finding generalized frequent itemsets in generalized association rule mining.	ISCC	2002	DBLP DOI BibTeX RDF
64	Brock Barber, Howard J. Hamilton	Parametric Algorithms for Mining Share-Frequent Itemsets.	ISMIS	2000	DBLP DOI BibTeX RDF
63	Congnan Luo, Anil L. Pereira, Soon Myoung Chung	Distributed Mining of Maximal Frequent Itemsets on a Data Grid System.	J. Supercomput.	2006	DBLP DOI BibTeX RDF	scalability, association rules, Data Grid, distributed data mining, maximal frequent itemsets
63	Arno J. Knobbe, Eric K. Y. Ho	Maximally informative k-itemsets and their efficient discovery.	KDD	2006	DBLP DOI BibTeX RDF	joint entropy, maximally informative k-itemsets, feature selection, information theory, subgroup discovery, binary data
61	Yongyan Wang, Kun Li, Hongan Wang	Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams.	CIDM	2009	DBLP DOI BibTeX RDF
59	Kun-Ta Chuang, Jiun-Long Huang, Ming-Syan Chen	Mining top-k frequent patterns in the presence of the memory constraint.	VLDB J.	2008	DBLP DOI BibTeX RDF
59	Junbo Chen, Bo Zhou 0010	TGC-Tree: An Online Algorithm Tracing Closed Itemset and Transaction Set Simultaneously.	LKR	2008	DBLP DOI BibTeX RDF
59	Wontae Hwang, Dongseung Kim	Improved Association Rule Mining by Modified Trimming.	CIT	2006	DBLP DOI BibTeX RDF
59	Jong Soo Park, Ming-Syan Chen, Philip S. Yu	An Effective Hash Based Algorithm for Mining Association Rules.	SIGMOD Conference	1995	DBLP DOI BibTeX RDF
56	Guimei Liu, Jinyan Li 0001, Limsoon Wong	A new concise representation of frequent itemsets using generators and a positive border.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Positive border, Data mining, Generator, Frequent itemset mining, Concise representation
56	Carson Kai-Sang Leung, Pourang Irani, Christopher L. Carmichael	WiFIsViz: Effective Visualization of Frequent Itemsets.	ICDM	2008	DBLP DOI BibTeX RDF
56	Haifeng Li 0006, Zongjian Lu, Hong Chen 0001	Mining Approximate Closed Frequent Itemsets over Stream.	SNPD	2008	DBLP DOI BibTeX RDF	stream, closed frequent itemset
56	Lisheng Ma, Yi Qi	An Efficient Algorithm for Frequent Closed Itemsets Mining.	CSSE (4)	2008	DBLP DOI BibTeX RDF
56	Jian Hu, Yang-Li Xiang	A New Fast Frequent Itemsets Mining Algorithm Based on Forest.	FSKD (2)	2008	DBLP DOI BibTeX RDF
56	Bashar Saleh, Florent Masseglia	Time Aware Mining of Itemsets.	TIME	2008	DBLP DOI BibTeX RDF
56	Alva Erwin, Raj P. Gopalan, N. R. Achuthan	Efficient Mining of High Utility Itemsets from Large Datasets.	PAKDD	2008	DBLP DOI BibTeX RDF	High Utility Mining, Pattern Growth
56	Arianna Gallo, Tijl De Bie, Nello Cristianini	MINI: Mining Informative Non-redundant Itemsets.	PKDD	2007	DBLP DOI BibTeX RDF
56	Ho Jin Woo, Won Suk Lee	estMax: Tracing Maximal Frequent Itemsets over Online Data Streams.	ICDM	2007	DBLP DOI BibTeX RDF
56	Xiangjun Dong, Gang Li, Hongguo Wang, Yuebin Guo, Yueyue Yang	Mining Infrequent Itemsets Based on Extended MMS Model.	ICIC (3)	2007	DBLP DOI BibTeX RDF
56	Bo Liu 0062, Jiuhui Pan	A Graph-Based Algorithm for Mining Maximal Frequent Itemsets.	FSKD (3)	2007	DBLP DOI BibTeX RDF
56	Jinze Liu, Susan Paulsen, Wei Wang 0010, Andrew B. Nobel, Jan F. Prins	Mining Approximate Frequent Itemsets from Noisy Data.	ICDM	2005	DBLP DOI BibTeX RDF
56	Xiaoming Yang, Zhibin Wang, Bing Liu 0009, Shouzhi Zhang, Wei Wang 0009, Bole Shi	Non-Almost-Derivable Frequent Itemsets Mining.	CIT	2005	DBLP DOI BibTeX RDF
56	Zhi-Hong Deng, Xin Li, Shi-Wei Tang	An Efficient Approach for Interactive Mining of Frequent Itemsets.	WAIM	2005	DBLP DOI BibTeX RDF
56	Duckjin Chai, Heeyoung Choi, Buhyun Hwang	Discovering Frequent Itemsets Using Transaction Identifiers.	FSKD (1)	2005	DBLP DOI BibTeX RDF
56	Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang 0001	A Fast Algorithm for Mining Share-Frequent Itemsets.	APWeb	2005	DBLP DOI BibTeX RDF
56	Soon M. Chung, Congnan Luo	Distributed mining of maximal frequent itemsets from databases on a cluster of workstations.	CCGRID	2004	DBLP DOI BibTeX RDF
56	Kritsada Sriphaew, Thanaruk Theeramunkong	Mining Generalized Closed Frequent Itemsets of Generalized Association Rules.	KES	2003	DBLP DOI BibTeX RDF
54	James Cheng, Yiping Ke, Wilfred Ng	A survey on algorithms for mining frequent itemsets over data streams.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Window models, Approximate algorithms, Frequent itemsets, Stream mining
54	Nikolaj Tatti	Maximum entropy based significance of itemsets.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Binary data mining, Maximum entropy, Itemsets
54	Shiguang Ju, Chen Chen	MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets.	ISIP	2008	DBLP DOI BibTeX RDF	data mining, association rules, maximal frequent itemsets
54	B. Kalpana, R. Nadarajan, J. Senthil Babu	A Galois Lattice framework to handle updates in the mining of closed itemsets in dynamic databases.	Bangalore Compute Conf.	2008	DBLP DOI BibTeX RDF	association rules, incremental mining, Galois Lattices, closed frequent itemsets
54	Haifeng Li 0006, Hong Chen 0001	Improve Frequent Closed Itemsets Mining over Data Stream with Bitmap.	SNPD	2008	DBLP DOI BibTeX RDF	stream, bitmap, frequent closed itemsets
54	Yanbin Ye, Chia-Chu Chiang	A Parallel Apriori Algorithm for Frequent Itemsets Mining.	SERA	2006	DBLP DOI BibTeX RDF	Frequent Itemsets Mining (FIM), Data Mining, Parallel Computing, Association Rules, Apriori
53	Karam Gouda, Mohammed Javeed Zaki	GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets.	Data Min. Knowl. Discov.	2005	DBLP DOI BibTeX RDF	maximal itemsets, data mining, association rules, frequent itemsets, backtracking search
53	Joong Hyuk Chang, Won Suk Lee	Finding recent frequent itemsets adaptively over online data streams.	KDD	2003	DBLP DOI BibTeX RDF	decay mechanism, delayed-insertion, pruning of itemsets, recent frequent itemsets, data stream
53	Fuzan Chen, Minqiang Li	An Efficiently Algorithm Based on Itemsets-Lattice and Bitmap Index for Finding Frequent Itemsets.	FSKD (2)	2005	DBLP DOI BibTeX RDF
53	K. K. Loo, Chi Lap Yip, Ben Kao, David Wai-Lok Cheung	Exploiting the Duality of Maximal Frequent Itemsets and Minimal Infrequent Itemsets for I/O Efficient Association Rule Mining.	DEXA	2000	DBLP DOI BibTeX RDF	Data mining, association rules, lattice
50	Willie Ng, Manoranjan Dash	Which Is Better for Frequent Pattern Mining: Approximate Counting or Sampling?.	DaWaK	2009	DBLP DOI BibTeX RDF
50	Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen	Hardware-Enhanced Association Rule Mining with Hashing and Pipelining.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF	hardware-enhanced mining, data mining, Association Rules
50	Mitica Craus	A New Parallel Algorithm for the Frequent Itemset Mining Problem.	ISPDC	2008	DBLP DOI BibTeX RDF
50	Huaiguo Fu, Mícheál Ó Foghlú	A Distributed Algorithm of Density-Based Subspace Frequent Closed Itemset Mining.	HPCC	2008	DBLP DOI BibTeX RDF