# IEEE Transactions on Knowledge and Data Engineering

IEEE Transactions on Knowledge and Data Engineering > 2006 > 18 > 6 > 721 - 737

IEEE Transactions on Knowledge and Data Engineering > 2006 > 18 > 8 > 1055 - 1067

IEEE Transactions on Knowledge and Data Engineering > 2006 > 18 > 8 > 1125 - 1137

IEEE Transactions on Knowledge and Data Engineering > 2007 > 19 > 12 > 1652 - 1665

IEEE Transactions on Knowledge and Data Engineering > 2008 > 20 > 1 > 26 - 39

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 2 > 161 - 177

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 5 > 638 - 651

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 6 > 840 - 853

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 6 > 925 - 938

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 6 > 814 - 828

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 8 > 1118 - 1132

_{1}or hellip or T

_{n}occurs in document d, and none of T

_{1+n},... T

_{n+m}occurs in d, then classify d under category c," where each T

_{i}is a conjunction of terms. The proposed method is simple and elegant. Despite this, the results of a systematic...

IEEE Transactions on Knowledge and Data Engineering > 2009 > 21 > 12 > 1692 - 1707

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 1 > 46 - 58

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 3 > 381 - 391

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 4 > 479 - 492

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 4 > 523 - 536

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 7 > 957 - 968

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 7 > 1028 - 1040

IEEE Transactions on Knowledge and Data Engineering > 2010 > 22 > 10 > 1388 - 1400

IEEE Transactions on Knowledge and Data Engineering > 2011 > 23 > 11 > 1601 - 1618