![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Satoshi Oyama
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c91]Takumi Tamura
, Hiroyoshi Ito
, Satoshi Oyama
, Atsuyuki Morishima
:
Influence of AI's Uncertainty in the Dawid-Skene Aggregation for Human-AI Crowdsourcing. iConference (3) 2024: 232-247 - 2023
- [c90]Riku Yoshioka, Yuko Sakurai, Satoshi Oyama, Masato Shinoda:
Proposing a New Security Game with Reward and Penalty. WI/IAT 2023: 205-212 - [i3]Sorachi Kurita, Satoshi Oyama, Itsuki Noda:
Predicate Classification Using Optimal Transport Loss in Scene Graph Generation. CoRR abs/2309.10430 (2023) - 2022
- [j23]Hiroki Morise, Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Neural collaborative filtering with multicriteria evaluation data. Appl. Soft Comput. 119: 108548 (2022) - [j22]Taisei Nohara, Satoshi Oyama
, Itsuki Noda:
Pairwise classification using quantum support vector machine with Kronecker kernel. Quantum Mach. Intell. 4(2): 1-13 (2022) - [c89]Kaname Muto, Satoshi Oyama, Itsuki Noda:
Explainable Recommendation Using Knowledge Graphs and Random Walks. IEEE Big Data 2022: 4028-4023 - [c88]Masato Shinoda, Yuko Sakurai, Satoshi Oyama:
Sample Complexity of Learning Multi-value Opinions in Social Networks. PRIMA 2022: 192-207 - [c87]Masato Ota, Yuko Sakurai, Satoshi Oyama:
Coalitional Game Theoretic Federated Learning. WI/IAT 2022: 48-55 - [i2]Hisashi Kashima, Satoshi Oyama, Hiromi Arai, Junichiro Mori:
Trustworthy Human Computation: A Survey. CoRR abs/2210.12324 (2022) - 2021
- [j21]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Factorization Machines with Regularization for Sparse Feature Interactions. J. Mach. Learn. Res. 22: 153:1-153:50 (2021) - [j20]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara
:
Sparse random feature maps for the item-multiset kernel. Neural Networks 143: 500-514 (2021) - [c86]Yu Sugawara, Satoshi Oyama, Masahito Kurihara:
Adaptive Rotation Forests: Decision Tree Ensembles for Sequential Learning. SMC 2021: 613-618 - 2020
- [j19]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Link Prediction Using Higher-Order Feature Combinations across Objects. IEICE Trans. Inf. Syst. 103-D(8): 1833-1842 (2020) - [j18]Jing Song, Satoshi Oyama, Masahito Kurihara:
Exploratory Causal Analysis of Open Data: Explanation Generation and Confounder Identification. J. Adv. Comput. Intell. Intell. Informatics 24(1): 142-155 (2020) - [c85]Takafumi Suzuki, Satoshi Oyama, Masahito Kurihara:
A Framework for Recommendation Algorithms Using Knowledge Graph and Random Walk Methods. IEEE BigData 2020: 3085-3087 - [c84]Wenqi Zhao, Satoshi Oyama, Masahito Kurihara:
Generating Natural Counterfactual Visual Explanations. IJCAI 2020: 5204-5205 - [c83]Kazuma Itakura, Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Adapting the Learning Rate of the Learning Rate in Hypergradient Descent. SCIS/ISIS 2020: 1-6 - [c82]Kazuki Toda, Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Unsupervised Feature Learning for Output Control of Generative Models. SCIS/ISIS 2020: 1-6 - [i1]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Factorization Machines with Regularization for Sparse Feature Interactions. CoRR abs/2010.09225 (2020)
2010 – 2019
- 2019
- [j17]Hiroki Morise, Satoshi Oyama, Masahito Kurihara:
Bayesian probabilistic tensor factorization for recommendation and rating aggregation with multicriteria evaluation data. Expert Syst. Appl. 131: 1-8 (2019) - [c81]Kyohei Atarashi, Subhransu Maji, Satoshi Oyama:
Random Feature Maps for the Itemset Kernel. AAAI 2019: 3199-3206 - [c80]Yuko Sakurai, Satoshi Oyama:
Analysis of Coalition Formation in Cooperative Games Using Crowdsourcing and Machine Learning. Australasian Conference on Artificial Intelligence 2019: 78-88 - [c79]Jing Song, Satoshi Oyama, Masahito Kurihara:
Identification of Possible Common Causes by Intrinsic Dimension Estimation. BigComp 2019: 1-8 - [c78]Tomoumi Takase
, Satoshi Oyama, Masahito Kurihara:
Evaluation of Stratified Validation in Neural Network Training with Imbalanced Data. BigComp 2019: 1-4 - [c77]Takafumi Suzuki, Satoshi Oyama, Masahito Kurihara:
Explainable Recommendation Using Review Text and a Knowledge Graph. IEEE BigData 2019: 4638-4643 - [c76]Shoma Kikuchi, Ichigaku Takigawa, Satoshi Oyama, Masahito Kurihara:
Learning Relevant Molecular Representations via Self-Attentive Graph Neural Networks. IEEE BigData 2019: 5364-5369 - [c75]Ryota Sekiya, Satoshi Oyama, Masahito Kurihara:
User-Adaptive Preparation of Mathematical Puzzles Using Item Response Theory and Deep Learning. IEA/AIE 2019: 530-537 - [c74]Kyohei Atarashi, Akimi Moriyama, Satoshi Oyama, Masahito Kurihara:
A Personalized Affect Response Model for Online News Articles. LaCATODA/BtG@IJCAI 2019: 5-10 - [c73]Yuko Sakurai, Satoshi Oyama, Mingyu Guo, Makoto Yokoo
:
Deep False-Name-Proof Auction Mechanisms. PRIMA 2019: 594-601 - 2018
- [j16]Tomoumi Takase
, Satoshi Oyama, Masahito Kurihara:
Why Does Large Batch Training Result in Poor Generalization? A Comprehensive Explanation and a Better Strategy from the Viewpoint of Stochastic Optimization. Neural Comput. 30(7) (2018) - [j15]Tomoumi Takase
, Satoshi Oyama, Masahito Kurihara:
Effective neural network training with adaptive learning rate based on training loss. Neural Networks 101: 68-78 (2018) - [c72]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara:
Semi-Supervised Learning From Crowds Using Deep Generative Models. AAAI 2018: 1555-1562 - [c71]Yukino Baba, Tomoumi Takase, Kyohei Atarashi, Satoshi Oyama, Hisashi Kashima:
Data Analysis Competition Platform for Educational Purposes: Lessons Learned and Future Challenges. AAAI 2018: 7887-7892 - [c70]Takafumi Suzuki, Satoshi Oyama, Masahito Kurihara:
Toward Explainable Recommendations: Generating Review Text from Multicriteria Evaluation Data. IEEE BigData 2018: 3549-3551 - [c69]Yuko Sakurai, Jun Kawahara, Satoshi Oyama:
Aggregating Crowd Opinions Using Shapley Value Regression. MIWAI 2018: 151-160 - [c68]Taiju Matsui, Satoshi Oyama, Masahito Kurihara:
Effect of Viewing Directions on Deep Reinforcement Learning in 3D Virtual Environment Minecraft. PRIMA 2018: 527-534 - [c67]Hiroyuki Ihara, Shunsuke Imai, Satoshi Oyama, Masahito Kurihara:
Implementation and Evaluation of Information Set Monte Carlo Tree Search for Pokémon. SMC 2018: 2182-2187 - [c66]Jing Song, Satoshi Oyama, Masahito Kurihara:
A Framework for Crowd-Based Causal Analysis of Open Data. SMC 2018: 2188-2193 - [c65]Masahito Kurihara, Satoshi Oyama, Tomoumi Takase
:
Longer Distance Weight Prediction for Faster Training of Neural Networks. SMC 2018: 2194-2199 - 2017
- [j14]Jing Song, Satoshi Oyama, Masahito Kurihara:
Tell cause from effect: models and evaluation. Int. J. Data Sci. Anal. 4(2): 99-112 (2017) - [c64]Hiroki Morise, Satoshi Oyama, Masahito Kurihara:
Collaborative filtering and rating aggregation based on multicriteria rating. IEEE BigData 2017: 4417-4422 - [c63]Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara, Kazune Furudo:
A Deep Neural Network for Pairwise Classification: Enabling Feature Conjunctions and Ensuring Symmetry. PAKDD (1) 2017: 83-95 - [c62]Yuko Sakurai, Masafumi Matsuda, Masato Shinoda, Satoshi Oyama:
Crowdsourcing Mechanism Design. PRIMA 2017: 495-503 - 2016
- [j13]Gota Gando, Taiga Yamada, Haruhiko Sato, Satoshi Oyama, Masahito Kurihara:
Fine-tuning deep convolutional neural networks for distinguishing illustrations from photographs. Expert Syst. Appl. 66: 295-301 (2016) - [j12]Satoshi Oyama
, Yukino Baba
, Ikki Ohmukai
, Hiroaki Dokoshi, Hisashi Kashima
:
Crowdsourcing chart digitizer: task design and quality control for making legacy open data machine-readable. Int. J. Data Sci. Anal. 2(1-2): 45-60 (2016) - 2015
- [c61]Satoshi Oyama, Yukino Baba, Ikki Ohmukai, Hiroaki Dokoshi, Hisashi Kashima:
From one star to three stars: Upgrading legacy open data using crowdsourcing. DSAA 2015: 1-9 - [c60]Yuko Sakurai, Satoshi Oyama, Masato Shinoda, Makoto Yokoo:
Flexible Reward Plans to Elicit Truthful Predictions in Crowdsourcing. HCOMP 2015: 28-29 - [c59]Lei Duan, Satoshi Oyama, Masahito Kurihara, Haruhiko Sato:
Crowdsourced Semantic Matching of Multi-Label Annotations. IJCAI 2015: 3483-3489 - [c58]Lei Duan, Satoshi Oyama, Haruhiko Sato, Masahito Kurihara:
Multi-Emotion Estimation in Narratives from Crowdsourced Annotations. JCDL 2015: 91-100 - [c57]Yuko Sakurai
, Masato Shinoda, Satoshi Oyama, Makoto Yokoo
:
Flexible Reward Plans for Crowdsourced Tasks. PRIMA 2015: 400-415 - [c56]Jun Ito, Jing Song, Hiroyuki Toda, Yoshimasa Koike, Satoshi Oyama:
Assessment of Tweet Credibility with LDA Features. WWW (Companion Volume) 2015: 953-958 - 2014
- [j11]Lei Duan, Satoshi Oyama, Haruhiko Sato, Masahito Kurihara:
Separate or joint? Estimation of multiple labels from crowdsourced annotations. Expert Syst. Appl. 41(13): 5723-5732 (2014) - [c55]Jingjing Wang, Satoshi Oyama, Masahito Kurihara, Hisashi Kashima:
Learning an accurate entity resolution model from crowdsourced labels. ICUIMC 2014: 103:1-103:8 - [c54]Yasuyuki Shirai, Hiroyuki Morita, Masakazu Nakamoto, Satoshi Oyama:
Analysis Using Popularity Awareness Index, Recency Index and Purchase Diversity in Group Buying. ICDM 2014: 100-114 - [c53]Keiki Zen, Masahiro Suzuki, Haruhiko Sato, Satoshi Oyama, Masahito Kurihara:
Monophonic sound source separation by non-negative sparse autoencoders. SMC 2014: 3623-3626 - [c52]Masahiro Suzuki, Haruhiko Sato, Satoshi Oyama, Masahito Kurihara:
Transfer learning based on the observation probability of each attribute. SMC 2014: 3627-3631 - [c51]Hiroki Takamatsu, Haruhiko Sato, Satoshi Oyama, Masahito Kurihara:
Method sequence generation for multiple object states using dynamic symbolic execution. SMC 2014: 3632-3636 - 2013
- [j10]Michal Ptaszynski
, Hiroaki Dokoshi, Satoshi Oyama, Rafal Rzepka
, Masahito Kurihara, Kenji Araki, Yoshio Momouchi:
Affect analysis in context of characters in narratives. Expert Syst. Appl. 40(1): 168-176 (2013) - [j9]Hao Liu, Satoshi Oyama, Masahito Kurihara, Haruhiko Sato:
Landmark FN-DBSCAN: An Efficient Density-Based Clustering Algorithm with Fuzzy Neighborhood. J. Adv. Comput. Intell. Intell. Informatics 17(1): 60-73 (2013) - [c50]Yasuyuki Shirai, Hiroyuki Takashima, Koji Tsuruma, Satoshi Oyama:
Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagrams. DASFAA (1) 2013: 56-70 - [c49]Satoshi Oyama, Yukino Baba, Yuko Sakurai, Hisashi Kashima:
EM-Based Inference of True Labels Using Confidence Judgments. HCOMP (Works in Progress / Demos) 2013 - [c48]Satoshi Oyama, Yukino Baba, Yuko Sakurai, Hisashi Kashima:
Accurate Integration of Crowdsourced Labels Using Workers' Self-reported Confidence Scores. IJCAI 2013: 2554-2560 - [c47]Hao Liu, Masahito Kurihara, Satoshi Oyama, Haruhiko Sato:
An incremental self-organizing neural network based on enhanced competitive Hebbian learning. IJCNN 2013: 1-8 - 2012
- [j8]Satoshi Oyama, Kohei Hayashi, Hisashi Kashima:
Link Prediction Across Time via Cross-Temporal Locality Preserving Projections. IEICE Trans. Inf. Syst. 95-D(11): 2664-2673 (2012) - [c46]Yasuyuki Shirai, Koji Tsuruma, Yuko Sakurai, Satoshi Oyama, Shin-ichi Minato:
Incremental Set Recommendation Based on Class Differences. PAKDD (1) 2012: 183-194 - [c45]Hao Liu, Haruhiko Sato, Satoshi Oyama, Masahito Kurihara:
A robust energy artificial neuron based incremental self-organizing neural network with a dynamic structure. SMC 2012: 1806-1811 - 2011
- [j7]Wei Wu, Jun Xu, Hang Li, Satoshi Oyama:
Learning a Robust Relevance Model for Search Using Kernel Methods. J. Mach. Learn. Res. 12: 1429-1458 (2011) - [c44]Yuku Takahashi, Hiroaki Ohshima
, Mitsuo Yamamoto, Hirotoshi Iwasaki, Satoshi Oyama, Katsumi Tanaka:
Evaluating significance of historical entities based on tempo-spatial impacts analysis using Wikipedia link structure. HT 2011: 83-92 - [c43]Satoshi Oyama, Kohei Hayashi, Hisashi Kashima:
Cross-Temporal Link Prediction. ICDM 2011: 1188-1193 - [c42]Mitsuo Yamamoto, Yuku Takahashi, Hirotoshi Iwasaki, Satoshi Oyama, Hiroaki Ohshima
, Katsumi Tanaka:
Extraction and Geographical Navigation of Important Historical Events in the Web. W2GIS 2011: 21-35 - [e1]Haixun Wang, Shijun Li, Satoshi Oyama, Xiaohua Hu, Tieyun Qian:
Web-Age Information Management - 12th International Conference, WAIM 2011, Wuhan, China, September 14-16, 2011. Proceedings. Lecture Notes in Computer Science 6897, Springer 2011, ISBN 978-3-642-23534-4 [contents] - 2010
- [j6]Hisashi Kashima, Satoshi Oyama, Yoshihiro Yamanishi, Koji Tsuda:
Cartesian Kernel: An Efficient Alternative to the Pairwise Kernel. IEICE Trans. Inf. Syst. 93-D(10): 2672-2679 (2010) - [c41]Makoto P. Kato, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Search as if you were in your home town: geographic search by regional context and dynamic feature-space selection. CIKM 2010: 1541-1544 - [c40]Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Cloud as Virtual Databases: Bridging Private Databases and Web Services. DASFAA (1) 2010: 491-497 - [c39]Makoto P. Kato, Satoshi Oyama, Hiroaki Ohshima
, Katsumi Tanaka:
Query by example for geographic entity search with implicit negative feedback. ICUIMC 2010: 45 - [c38]Ryohei Takahashi, Satoshi Oyama, Hiroaki Ohshima
, Katsumi Tanaka:
Evaluating Truthfulness of Modifiers Attached to Web Entity Names. WAIM 2010: 429-440 - [c37]Natsuki Takata, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Searching the Web for Alternative Answers to Questions on WebQA Sites. WAIM 2010: 441-452
2000 – 2009
- 2009
- [c36]Makoto P. Kato, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Query by analogical example: relational search using web search engine indices. CIKM 2009: 27-36 - [c35]Hiroaki Ohshima
, Satoshi Oyama, Hiroyuki Kondo, Katsumi Tanaka:
Web information credibility analysis by geographical social support. IUCS 2009: 193-196 - [c34]Adam Jatowt
, Kensuke Kanazawa, Satoshi Oyama, Katsumi Tanaka:
Supporting analysis of future-related information in news archives and the web. JCDL 2009: 115-124 - [c33]Hisashi Kashima, Satoshi Oyama, Yoshihiro Yamanishi, Koji Tsuda:
On Pairwise Kernels: An Efficient Alternative and Generalization Analysis. PAKDD 2009: 1030-1037 - [c32]Takuya Kobayashi, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Modeling and analyzing review information on the web focusing on credibility. SAC 2009: 1316-1317 - [c31]Hiroaki Ohshima
, Adam Jatowt, Satoshi Oyama, Katsumi Tanaka:
Seeing Past Rivals: Visualizing Evolution of Coordinate Terms over Time. WISE 2009: 167-180 - [c30]Hiroaki Ohshima
, Adam Jatowt, Satoshi Oyama, Satoshi Nakamura, Katsumi Tanaka:
Towards Improving Web Search: A Large-Scale Exploratory Study of Selected Aspects of User Search Behavior. WISE 2009: 379-386 - [c29]Takuya Kobayashi, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Evaluating brand value on the web. WICOW 2009: 67-74 - 2008
- [j5]Heeryon Cho
, Toru Ishida
, Satoshi Oyama, Rieko Inaba, Toshiyuki Takasaki:
Assisting Pictogram Selection with Categorized Semantics. IEICE Trans. Inf. Syst. 91-D(11): 2638-2646 (2008) - [c28]Shun Hattori, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Mining the Web for Hyponymy Relations Based on Property Inheritance. APWeb 2008: 99-110 - [c27]Satoshi Oyama, Katsumi Tanaka:
How Many Objects?: Determining the Number of Clusters with a Skewed Distribution. ECAI 2008: 771-772 - [c26]Heeryon Cho
, Toru Ishida
, Toshiyuki Takasaki, Satoshi Oyama:
Assisting Pictogram Selection with Semantic Interpretation. ESWC 2008: 65-79 - [c25]Taiga Yoshida, Satoshi Nakamura, Satoshi Oyama, Katsumi Tanaka:
Query Transformation by Visualizing and Utilizing Information about What Users Are or Are Not Searching. ICADL 2008: 124-133 - [c24]Satoshi Oyama:
Vehicle Safety Communications: Progresses in Japan. ICVES 2008: 241 - [c23]Satoshi Oyama, Kenichi Shirasuna, Katsumi Tanaka:
Identification of time-varying objects on the web. JCDL 2008: 285-294 - [c22]Satoshi Oyama:
Status of ITS radiocommunications standards and their perspectives in Japan. PIMRC 2008: 1 - [c21]Masashi Yamaguchi, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Unsupervised Discovery of Coordinate Terms for Multiple Aspects from Search Engine Query Logs. Web Intelligence 2008: 249-257 - [c20]Makoto P. Kato, Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Can Social Tagging Improve Web Image Search?. WISE 2008: 235-249 - 2007
- [c19]Shun Hattori, Taro Tezuka, Hiroaki Ohshima
, Satoshi Oyama, Junpei Kawamoto, Keishi Tajima, Katsumi Tanaka:
ReCQ: Real-World Context-Aware Querying. CONTEXT 2007: 248-262 - [c18]Satoshi Nakamura, Shinji Konishi, Adam Jatowt, Hiroaki Ohshima
, Hiroyuki Kondo, Taro Tezuka, Satoshi Oyama, Katsumi Tanaka:
Trustworthiness Analysis of Web Search Results. ECDL 2007: 38-49 - [c17]Rui Kimura, Satoshi Oyama, Hiroyuki Toda, Katsumi Tanaka:
Creating Personal Histories from the Web Using Namesake Disambiguation and Event Extraction. ICWE 2007: 400-414 - 2006
- [c16]Takahiro Kawashige, Satoshi Oyama, Hiroaki Ohshima
, Katsumi Tanaka:
Context Matcher: Improved Web Search Using Query Term Context in Source Document and in Search Results. APWeb 2006: 486-497 - [c15]Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Extracting Semantic Relationships Between Terms from PC Documents and Its Applications to Web Search Personalization. APWeb 2006: 579-590 - [c14]Chi Tian, Taro Tezuka, Satoshi Oyama, Keishi Tajima, Katsumi Tanaka:
Improving Web Retrieval Precision Based on Semantic Relationships and Proximity of Query Keywords. DEXA 2006: 54-63 - [c13]Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Sibling Page Search by Page Examples. ICADL 2006: 91-100 - [c12]Chi Tian, Taro Tezuka, Satoshi Oyama, Keishi Tajima, Katsumi Tanaka:
Web Search Improvement Based on Proximity and Density of Miltiple Keywords. ICDE Workshops 2006: 133 - [c11]Yutaka Kabutoya, Takayuki Yumoto, Satoshi Oyama, Keishi Tajima, Katsumi Tanaka:
Quality Estimation of Local Contents Based on PageRank Values of Web Pages. ICDE Workshops 2006: 134 - [c10]Satoshi Oyama, Katsumi Tanaka:
Learning a Distance Metric for Object Identification Without Human Supervision. PKDD 2006: 609-616 - [c9]Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Searching Coordinate Terms with Their Context from the Web. WISE 2006: 40-47 - 2005
- [c8]Hiroaki Ohshima
, Satoshi Oyama, Katsumi Tanaka:
Extracting Personal Conceptual Structures from PC Documents and its Application to Web Search Personalization. ICDE Workshops 2005: 1228 - [c7]Yasunori Matsuike, Satoshi Oyama, Katsumi Tanaka:
Approximate Intensional Representation of Web Search Results. WISE 2005: 607-608 - 2004
- [j4]Saeko Nomura, Satoshi Oyama, Tetsuo Hayamizu, Toru Ishida
:
Analysis and improvement of HITS algorithm for detecting Web communities. Syst. Comput. Jpn. 35(13): 32-42 (2004) - [j3]Satoshi Oyama, Takashi Kokubo, Toru Ishida
:
Domain-Specific Web Search with Keyword Spices. IEEE Trans. Knowl. Data Eng. 16(1): 17-27 (2004) - [c6]Satoshi Oyama, Katsumi Tanaka:
Query Modification by Discovering Topics from Web Page Structures. APWeb 2004: 553-564 - [c5]Satoshi Oyama, Christopher D. Manning:
Using Feature Conjunctions Across Examples for Learning Pairwise Classifiers. ECML 2004: 322-333 - 2003
- [j2]Satoshi Oyama, Toru Ishida
:
Applying association rules to information navigation. Syst. Comput. Jpn. 34(4): 12-20 (2003) - [c4]Satoshi Oyama, Katsumi Tanaka:
Exploiting Document Structures for Comparing and Exploring Topics on the Web. WWW (Posters) 2003 - 2002
- [c3]Saeko Nomura, Satoshi Oyama, Tetsuo Hayamizu, Toru Ishida
:
Analysis and Improvement of HITS Algorithm for Detecting Web Communitie. SAINT 2002: 132-140 - [c2]Shinsuke Nakajima, Satoshi Oyama, Kazutoshi Sumiya, Katsumi Tanaka:
Context-Dependent Web Bookmarks and Their Usage as Queries. WISE 2002: 333-344 - 2001
- [j1]Satoshi Oyama, Kaoru Hiramatsu, Toru Ishida
:
Cooperative Information Agents for Digital Cities. Int. J. Cooperative Inf. Syst. 10(1-2): 197-215 (2001) - [c1]Satoshi Oyama, Takashi Kokubo, Toru Ishida, Teruhiro Yamada, Yasuhiko Kitamura:
Keyword Spices: A New Method for Building Domain-Specific Web Search Engines. IJCAI 2001: 1457-1466
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint