![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ronen Feldman Binyamin Rosenfeld , Ronen Feldman, Moshe Fresko , Jonathan Schler , Yonatan Aumann : TEG: a hybrid approach to information extraction. CIKM 2004 : 589-596 Hagit Shatkay , Ronen Feldman: Mining the Biomedical Literature in the Genomic Era: An Overview. Journal of Computational Biology 10 (6): 821-855 (2003) Ronen Feldman, Yonatan Aumann , Michal Finkelstein-Landau , Eyal Hurvitz , Yizhar Regev , Ariel Yaroshevich : A Comparative Study of Information Extraction Strategies. CICLing 2002 : 349-359 Binyamin Rosenfeld , Ronen Feldman, Yonatan Aumann : Structural extraction from visual layout of documents. CIKM 2002 : 203-210 Yizhar Regev , Michal Finkelstein-Landau , Ronen Feldman: Rule-based Extraction of Experimental Evidence in the Biomedical Domain - the Kdd Cup (Task 1). SIGKDD Explorations 4 (2): 90-92 (2002) Ronen Feldman, Yonatan Aumann , Yair Liberzon , Kfir Ankori , Yonatan Schler , Binyamin Rosenfeld : A Domain Independent Environment for Creating Information Extraction Modules. CIKM 2001 : 586-588 Ronen Feldman, Yair Liberzon , Binyamin Rosenfeld , Yonatan Schler , Jonathan Stoppi : A framework for specifying explicit bias for revision of approximate information extraction rules. KDD 2000 : 189-197 Ronen Feldman: Mining Unstructured Data. KDD Tutorial Notes 1999 : 182-236 Ronen Feldman, Yonatan Aumann , Moshe Fresko , Orly Liphstat , Binyamin Rosenfeld , Yonatan Schler : Text Mining via Information Extraction. PKDD 1999 : 165-173 Yonatan Aumann , Ronen Feldman, Yaron Ben-Yehuda , David Landau , Orly Liphstat , Yonatan Schler : Circle Graphs: New Visualization Tools for Text-Mining. PKDD 1999 : 277-282 Yonatan Aumann , Ronen Feldman, Orly Liphstat , Heikki Mannila : Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. J. Intell. Inf. Syst. 12 (1): 61-73 (1999) Ronen Feldman, Moshe Fresko , Haym Hirsh , Yonatan Aumann , Orly Liphstat , Yonatan Schler , Martin Rajman : Knowledge Management: A Text Mining Approach. PAKM 1998 Ronen Feldman, Yonatan Aumann , Amir Zilberstein , Yaron Ben-Yehuda : Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. PKDD 1998 : 38-46 Ronen Feldman: Practical Text Mining. PKDD 1998 : 478 David Landau , Ronen Feldman, Yonatan Aumann , Moshe Fresko , Yehuda Lindell , Orly Liphstat , Oren Zamir : TextVis: An Integrated Visual Environment for Text Mining. PKDD 1998 : 56-64 Ronen Feldman, Moshe Fresko , Yakkov Kinar , Yehuda Lindell , Orly Liphstat , Martin Rajman , Yonatan Schler , Oren Zamir : Text Mining at the Term Level. PKDD 1998 : 65-73 Ronen Feldman, Ido Dagan , Haym Hirsh : Mining Text Using Keyword Distributions. J. Intell. Inf. Syst. 10 (3): 281-300 (1998) Ronen Feldman, Willi Klösgen : Data Mining on the Web: A Promising Challenge? KI 12 (1): 35-36 (1998) Ronen Feldman, Yonatan Aumann , Amihood Amir , Heikki Mannila : Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 : 0- Ronen Feldman, Willi Klösgen , Amir Zilberstein : Document Explorer: Discovering Knowledge in Document Collections. ISMIS 1997 : 137-146 Ronen Feldman, Willi Klösgen , Amir Zilberstein : Visualization Techniques to Explore Data Mining Results for Document Collections. KDD 1997 : 16-23 Ronen Feldman, Yonatan Aumann , Amihood Amir , Amir Zilberstein , Willi Klösgen : Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD 1997 : 167-170 Ronen Feldman, Willi Klösgen , Yaniv Ben-Yehuda , Gil Kedar , Vladimir Reznikov : Pattern Based Browsing in Document Collections. PKDD 1997 : 112-122 Amihood Amir , Ronen Feldman, Reuven Kashi : A New and Versatile Method for Association Generation. PKDD 1997 : 221-231 Amihood Amir , Ronen Feldman, Reuven Kashi : A New and Versatile Method for Association Generation. Inf. Syst. 22 (6/7): 333-347 (1997) Ronen Feldman, Haym Hirsh : Exploiting Background Information in Knowledge Discovery from Text. J. Intell. Inf. Syst. 9 (1): 83-97 (1997) Ronen Feldman, Haym Hirsh : Mining Associations in Text in the Presence of Background Knowledge. KDD 1996 : 343-346 Ronen Feldman, Ido Dagan : Knowledge Discovery in Textual Databases (KDT). KDD 1995 : 112-117 Moshe Koppel , Alberto Maria Segre , Ronen Feldman: Getting the Most from Flawed Theories. ICML 1994 : 139-147 Moshe Koppel , Ronen Feldman, Alberto Maria Segre : Bias-Driven Revision of Logical Domain Theories CoRR cs.AI/9402103 : (1994) Moshe Koppel , Ronen Feldman, Alberto Maria Segre : Bias-Driven Revision of Logical Domain Theories. J. Artif. Intell. Res. (JAIR) 1 : 159-208 (1994) Ronen Feldman, Alberto Serge , Moshe Koppel : Incremental Refinement of Approximate Domain Theories. ML 1991 : 500-504 Devika Subramanian , Ronen Feldman: The Utility of EBL in Recursive Domain Theories. AAAI 1990 : 942-949 Ronen Feldman, Martin Charles Golumbic : Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1 : 49-73 (1990) Ronen Feldman, Martin Charles Golumbic : Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33 (4): 356-364 (1990) Ronen Feldman, Martin Charles Golumbic : Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI 1989 : 1010-1016 1 [ 12 ] [ 13 ] [ 15 ] [ 18 ] 2 [ 31 ] 3 [ 15 ] [ 18 ] [ 22 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 31 ] [ 33 ] [ 34 ] [ 36 ] 4 [ 14 ] 5 [ 24 ] [ 27 ] 6 [ 9 ] [ 20 ] 7 [ 32 ] [ 34 ] 8 [ 21 ] [ 22 ] [ 25 ] [ 28 ] [ 36 ] 9 [ 1 ] [ 2 ] [ 3 ] 10 [ 10 ] [ 11 ] [ 20 ] [ 25 ] 11 [ 34 ] 12 [ 12 ] [ 13 ] 13 [ 14 ] 14 [ 21 ] 15 [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 19 ] 16 [ 5 ] [ 6 ] [ 7 ] [ 8 ] 17 [ 22 ] [ 27 ] 18 [ 30 ] [ 31 ] 19 [ 21 ] [ 22 ] 20 [ 21 ] [ 22 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] 21 [ 18 ] [ 26 ] 22 [ 21 ] [ 25 ] 23 [ 32 ] [ 34 ] 24 [ 14 ] 25 [ 28 ] [ 30 ] [ 31 ] [ 33 ] [ 36 ] 26 [ 36 ] 27 [ 21 ] [ 25 ] [ 27 ] [ 28 ] [ 30 ] [ 31 ] 28 [ 6 ] [ 7 ] [ 8 ] 29 [ 5 ] 30 [ 35 ] 31 [ 30 ] 32 [ 4 ] 33 [ 34 ] 34 [ 21 ] [ 22 ] 35 [ 15 ] [ 16 ] [ 17 ] [ 24 ] ![]() ©2005 Association for Computing Machinery |