January 2009
祈福許願燈 →
Extreme data mining →
(2008), pp. 1-2. At Google, the quality and speed of statistical data mining algorithms directly affects the usefulness of our search results and the relevance of our targeted advertising. One of…
城堡 (3) →
城堡 (2) →
Question: Netflix Prize within months? →
獲得2008年度 Netflix Progress Prize 的團隊 BellKor in BigChaos 在今年一月初，又提交一次成果，這回他們把成績從 RMSE 0.8616 推進到 RMSE 0.8598，距離得獎所需的標準 0.8563 又推進一大步。
…
Understanding Complex Datasets: Data Mining with... →
(17 May 2007) Making obscure knowledge about matrix decompositions widely available, Understanding Complex Datasets: Data Mining with Matrix Decompositions discusses the most common matrix…
Social networks that matter: Twitter under the... →
(4 Dec 2008) Scholars, advertisers and political activists see massive online social networks as a representation of social interactions that can be used to study the propagation of ideas, social…
Fuzzy Neural Intelligent Systems: Mathematical... →
(21 September 2000) Although fuzzy systems and neural networks stand central to the field of soft computing, most research work has focused in the development of the theories, algorithms, and…
Fuzzy Systems Design: Social and Engineering... →
(02 September 1998) Fuzzy logic is a way of thinking that is responsive to human zeal to unveil uncertainty and deal with social paradoxes emerging from it. In this book a number of articles…
Fuzzy Set Theory and its Applications →
(15 October 2001) Since its inception, the theory of fuzzy sets has advanced in a variety of ways and in many disciplines. Applications of fuzzy technology can be found in artificial intelligence,…
Personalized recommendation system based on... →
Expert Systems with Applications, Vol. In Press, Corrected Proof In this paper, we developed a recommendation system which enables bidirectional communication between the user and system using an…
小數點後多少位才夠 →
前些日子，家裡的長官因為指導學生科展的緣故，需要計算根號二、根號三的數值到小數點後三千位，在網路上找了兩天，始終找不到合適的資料。幾經思索，她發現找到資料的最佳方法，就是把任務交代下去，於是這個任務就落到我頭上，並且責令鄙人於兩日內限時完成任務。 …
最近在读The Heart Aroused →
偶拾 →
平日服用的藥（慢性病，長期處方）在年前兩天就用完了，但是因為某個不可抗力的突發工作的緣故，竟抽不出空去領藥。只得拼命趕工，在完工報告寄送到美國之後，趁著年假中趕到醫院領藥。大醫院裡掛號繳費，現在都得先抽號碼牌，然後坐在櫃台前的等候區，等著合成的機器聲音叫號，才上前辦理。 一
輪到我繳費，在繳費窗口前，聽到隔鄰窗口一個年輕而悅耳的女聲平靜的說：「今天下午婦產科，謝謝！」 …
December 2008
H-mine: hyper-structure mining of frequent... →
Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on (2001), pp. 441-448. Methods for efficient mining of frequent patterns have been studied extensively by many researchers….
Using a hash-based method with transaction... →
Knowledge and Data Engineering, IEEE Transactions on, Vol. 9, No. 5. (1997), pp. 813-825. We examine the issue of mining association rules among items in a large database of sales transactions….
Sampling Large Databases for Association Rules →
(1996), pp. 134-145. H Toivonen, Others
Turbo-charging vertical mining of large databases →
SIGMOD Rec., Vol. 29, No. 2. (2000), pp. 22-33. In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it…
LPMiner: an algorithm for finding frequent... →
Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on (2001), pp. 505-512. Over the years, a variety of algorithms for finding frequent item sets in very large transaction…
Fast sequential and parallel algorithms for... →
(1995) Andreas Mueller
Generating Frequent Patterns with the Frequent... →
(2001), pp. 376-386. Fan Tseng, Ching Hsu
Mining generalized association rules →
Future Generation Computer Systems, Vol. 13, No. 2—3. (1997), pp. 161-180. We introduce the problem of mining generalized association rules. Given a large database of transactions, where each…
An Efficient Algorithm for the Incremental... →
Knowledge Discovery and Data Mining (1997), pp. 263-266. S Thomas, S Bodagala, K Alsabti, S Ranka
Fast Algorithms for Mining Association Rules →
(December—JanuaryMay~ 1994), pp. 487-499. We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for…
Dynamic itemset counting and implication rules for... →
(1997), pp. 255-264. Sergey Brin, Rajeev Motwani, Jeffrey Ullman, Shalom Tsur
Mining frequent patterns without candidate... →
(May 2000), pp. 1-12. Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the…
Mining Quantitative Association Rules in Large... →
(April—June~ 1996), pp. 1-12. We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an…
Discovering Frequent Closed Itemsets for... →
Lecture Notes in Computer Science, Vol. 1540 (1999), pp. 398-416. In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we…
Fast Algorithms for Mining Association Rules in... →
(1994), pp. 487-499. Rakesh Agrawal, Ramakrishnan Srikant